Base | Representation |
---|---|
bin | 1001000110101101111000… |
… | …1101111101101011000000 |
3 | 1022110001010221102212110002 |
4 | 2101223132031331223000 |
5 | 2303010013003031422 |
6 | 33142554004055132 |
7 | 2052161650666226 |
oct | 221533615755300 |
9 | 38401127385402 |
10 | 10011002002112 |
11 | 320a70770a051 |
12 | 11582483944a8 |
13 | 578058604247 |
14 | 26876c3a0b16 |
15 | 125620c7a692 |
hex | 91ade37dac0 |
10011002002112 has 14 divisors (see below), whose sum is σ = 19865582098068. Its totient is φ = 5005501001024.
The previous prime is 10011002002093. The next prime is 10011002002117. The reversal of 10011002002112 is 21120020011001.
It is a super-2 number, since 2×100110020021122 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10011002002093 and 10011002002102.
It is not an unprimeable number, because it can be changed into a prime (10011002002117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 78210953078 + ... + 78210953205.
It is an arithmetic number, because the mean of its divisors is an integer number (1418970149862).
Almost surely, 210011002002112 is an apocalyptic number.
It is an amenable number.
10011002002112 is a deficient number, since it is larger than the sum of its proper divisors (9854580095956).
10011002002112 is an equidigital number, since it uses as much as digits as its factorization.
10011002002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156421906295 (or 156421906285 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10011002002112 its reverse (21120020011001), we get a palindrome (31131022013113).
The spelling of 10011002002112 in words is "ten trillion, eleven billion, two million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •