Base | Representation |
---|---|
bin | 10010101000010110… |
… | …00001101010001111 |
3 | 221211001201220000222 |
4 | 21110023001222033 |
5 | 130441020023434 |
6 | 4332255541555 |
7 | 502601353550 |
oct | 112413015217 |
9 | 27731656028 |
10 | 10002111119 |
11 | 4272a27140 |
12 | 1b3182a8bb |
13 | c35279360 |
14 | 6ac552327 |
15 | 3d817872e |
hex | 2542c1a8f |
10002111119 has 96 divisors (see below), whose sum is σ = 14378757120. Its totient is φ = 6717427200.
The previous prime is 10002111101. The next prime is 10002111121. The reversal of 10002111119 is 91111120001.
It is a happy number.
It is not a de Polignac number, because 10002111119 - 28 = 10002110863 is a prime.
It is a super-2 number, since 2×100021111192 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10002111097 and 10002111106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10002111179) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 32160974 + ... + 32161284.
It is an arithmetic number, because the mean of its divisors is an integer number (149778720).
Almost surely, 210002111119 is an apocalyptic number.
10002111119 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
10002111119 is a deficient number, since it is larger than the sum of its proper divisors (4376646001).
10002111119 is a wasteful number, since it uses less digits than its factorization.
10002111119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469 (or 450 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 17.
It can be divided in two parts, 10002 and 111119, that added together give a palindrome (121121).
The spelling of 10002111119 in words is "ten billion, two million, one hundred eleven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •