Search results
Results from the WOW.Com Content Network
The sum of the ones digit, double the tens digit, and four times the hundreds digit is divisible by 8. 34,152: 4 × 1 + 5 × 2 + 2 = 16. 9: The sum of the digits must be divisible by 9. [2] [4] [5] 2,880: 2 + 8 + 8 + 0 = 18: 1 + 8 = 9. Subtracting 8 times the last digit from the rest gives a multiple of 9. (Works because 81 is divisible by 9)
2012 – The number 8 × 10 2012 − 1 is a prime number [10] 2013 – number of widely totally strongly normal compositions of 17; 2014 – 5 × 2 2014 - 1 is prime [11] 2015 – Lucas–Carmichael number [12] 2016 – triangular number, number of 5-cubes in a 9-cube, Erdős–Nicolas number, [13] 2 11-2 5; 2017 – Mertens function zero, sexy ...
d() is the number of positive divisors of n, including 1 and n itself; σ() is the sum of the positive divisors of n, including 1 and n itselfs() is the sum of the proper divisors of n, including 1 but not n itself; that is, s(n) = σ(n) − n
In the past 500 years, there was no leap day in 1700, 1800 and 1900, but 2000 had one. In the next 500 years, if the practice is followed, there will be no leap day in 2100, 2200, 2300 and 2500 ...
The first: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23 (sequence A005408 in the OEIS). All integers are either even or odd. All integers are either even or odd. A square has even multiplicity for all prime factors (it is of the form a 2 for some a ).
the k given prime numbers p i must be precisely the first k prime numbers (2, 3, 5, ...); if not, we could replace one of the given primes by a smaller prime, and thus obtain a smaller number than n with the same number of divisors (for instance 10 = 2 × 5 may be replaced with 6 = 2 × 3; both have four divisors);
The first 15 superior highly composite numbers, 2, 6, 12, 60, 120, 360, 2520, 5040, 55440, 720720, 1441440, 4324320, 21621600, 367567200, 6983776800 (sequence A002201 in the OEIS) are also the first 15 colossally abundant numbers, which meet a similar condition based on the sum-of-divisors function rather than the number of divisors. Neither ...
The final digit of a triangular number is 0, 1, 3, 5, 6, or 8, and thus such numbers never end in 2, 4, 7, or 9. A final 3 must be preceded by a 0 or 5; a final 8 must be preceded by a 2 or 7. In base 10, the digital root of a nonzero triangular number is always 1, 3, 6, or 9. Hence, every triangular number is either divisible by three or has a ...