Base | Representation |
---|---|
bin | 10110101111010111100001… |
… | …110100000001111001011111 |
3 | 111010010001201100100211122012 |
4 | 112233113201310001321133 |
5 | 101102044241103001343 |
6 | 552412531514341435 |
7 | 30031431056351600 |
oct | 2657274164017137 |
9 | 433101640324565 |
10 | 100012102000223 |
11 | 299599922a6056 |
12 | b27302272a87b |
13 | 43a614047181a |
14 | 1a9a87c1c1da7 |
15 | b86826e8c718 |
hex | 5af5e1d01e5f |
100012102000223 has 12 divisors (see below), whose sum is σ = 122463798368760. Its totient is φ = 81212834706192.
The previous prime is 100012102000207. The next prime is 100012102000229. The reversal of 100012102000223 is 322000201210001.
It is a happy number.
It is not a de Polignac number, because 100012102000223 - 24 = 100012102000207 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100012102000198 and 100012102000207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100012102000229) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 53712191336 + ... + 53712193197.
It is an arithmetic number, because the mean of its divisors is an integer number (10205316530730).
Almost surely, 2100012102000223 is an apocalyptic number.
100012102000223 is a deficient number, since it is larger than the sum of its proper divisors (22451696368537).
100012102000223 is a wasteful number, since it uses less digits than its factorization.
100012102000223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107424384566 (or 107424384559 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 100012102000223 its reverse (322000201210001), we get a palindrome (422012303210224).
The spelling of 100012102000223 in words is "one hundred trillion, twelve billion, one hundred two million, two hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •