Base | Representation |
---|---|
bin | 111011101111111… |
… | …101000101011000 |
3 | 2120212020112221021 |
4 | 323233331011120 |
5 | 4023110123322 |
6 | 243245252224 |
7 | 33561325600 |
oct | 7357750530 |
9 | 2525215837 |
10 | 1002426712 |
11 | 474931031 |
12 | 23b864074 |
13 | 12c8a9901 |
14 | 971bdc00 |
15 | 5d0104c7 |
hex | 3bbfd158 |
1002426712 has 96 divisors (see below), whose sum is σ = 2266351920. Its totient is φ = 414167040.
The previous prime is 1002426703. The next prime is 1002426749. The reversal of 1002426712 is 2176242001.
It is a super-2 number, since 2×10024267122 = 2009718625862261888, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1558663 + ... + 1559305.
Almost surely, 21002426712 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1002426712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1133175960).
1002426712 is an abundant number, since it is smaller than the sum of its proper divisors (1263925208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002426712 is a wasteful number, since it uses less digits than its factorization.
1002426712 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 801 (or 790 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 25.
The square root of 1002426712 is about 31661.1230375677. The cubic root of 1002426712 is about 1000.8082505550.
Adding to 1002426712 its reverse (2176242001), we get a palindrome (3178668713).
The spelling of 1002426712 in words is "one billion, two million, four hundred twenty-six thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •