Base | Representation |
---|---|
bin | 11001011101110110000000… |
… | …000101011111001101101011 |
3 | 112200120021202201122002122202 |
4 | 121131312000011133031223 |
5 | 104140020104320200021 |
6 | 1034113002533410415 |
7 | 32406610150220144 |
oct | 3135660005371553 |
9 | 480507681562582 |
10 | 112002011100011 |
11 | 3276187141a1aa |
12 | 1068a8a6a99a0b |
13 | 4a6598a398326 |
14 | 1d92cd7938acb |
15 | ce3669046a0b |
hex | 65dd8015f36b |
112002011100011 has 2 divisors, whose sum is σ = 112002011100012. Its totient is φ = 112002011100010.
The previous prime is 112002011099963. The next prime is 112002011100041. The reversal of 112002011100011 is 110001110200211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112002011100011 - 26 = 112002011099947 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112002011099965 and 112002011100001.
It is not a weakly prime, because it can be changed into another prime (112002011100041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56001005550005 + 56001005550006.
It is an arithmetic number, because the mean of its divisors is an integer number (56001005550006).
Almost surely, 2112002011100011 is an apocalyptic number.
112002011100011 is a deficient number, since it is larger than the sum of its proper divisors (1).
112002011100011 is an equidigital number, since it uses as much as digits as its factorization.
112002011100011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 112002011100011 its reverse (110001110200211), we get a palindrome (222003121300222).
The spelling of 112002011100011 in words is "one hundred twelve trillion, two billion, eleven million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •