Base | Representation |
---|---|
bin | 10110101111010111011100… |
… | …011000111001000011001010 |
3 | 111010010001111000010112210221 |
4 | 112233113130120321003022 |
5 | 101102044044304000020 |
6 | 552412514504100254 |
7 | 30031425603022054 |
oct | 2657273430710312 |
9 | 433101430115727 |
10 | 100012011000010 |
11 | 299599459a126a |
12 | b272bb816468a |
13 | 43a612765c545 |
14 | 1a9a8700948d4 |
15 | b8681deb46aa |
hex | 5af5dc6390ca |
100012011000010 has 8 divisors (see below), whose sum is σ = 180021619800036. Its totient is φ = 40004804400000.
The previous prime is 100012010999959. The next prime is 100012011000053. The reversal of 100012011000010 is 10000110210001.
It can be written as a sum of positive squares in 2 ways, for example, as 94712038104121 + 5299972895889 = 9732011^2 + 2302167^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1000120110000102 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100012010999957 and 100012011000002.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5000600549991 + ... + 5000600550010.
Almost surely, 2100012011000010 is an apocalyptic number.
100012011000010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100012011000010 is a deficient number, since it is larger than the sum of its proper divisors (80009608800026).
100012011000010 is a wasteful number, since it uses less digits than its factorization.
100012011000010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10001201100008.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 100012011000010 its reverse (10000110210001), we get a palindrome (110012121210011).
The spelling of 100012011000010 in words is "one hundred trillion, twelve billion, eleven million, ten", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •