Base | Representation |
---|---|
bin | 11001011101111101011100… |
… | …010001001001100111111001 |
3 | 112200121001101111100222000011 |
4 | 121131331130101021213321 |
5 | 104140132440012041441 |
6 | 1034120403401541521 |
7 | 32410312135544506 |
oct | 3135753421114771 |
9 | 480531344328004 |
10 | 112010000112121 |
11 | 327651a0a72251 |
12 | 106903564a48a1 |
13 | 4a66661562027 |
14 | 1d934549824ad |
15 | ce39855c1581 |
hex | 65df5c4499f9 |
112010000112121 has 2 divisors, whose sum is σ = 112010000112122. Its totient is φ = 112010000112120.
The previous prime is 112010000112113. The next prime is 112010000112161. The reversal of 112010000112121 is 121211000010211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95743015546896 + 16266984565225 = 9784836^2 + 4033235^2 .
It is a cyclic number.
It is not a de Polignac number, because 112010000112121 - 23 = 112010000112113 is a prime.
It is a super-2 number, since 2×1120100001121212 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112010000112161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56005000056060 + 56005000056061.
It is an arithmetic number, because the mean of its divisors is an integer number (56005000056061).
Almost surely, 2112010000112121 is an apocalyptic number.
It is an amenable number.
112010000112121 is a deficient number, since it is larger than the sum of its proper divisors (1).
112010000112121 is an equidigital number, since it uses as much as digits as its factorization.
112010000112121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112010000112121 its reverse (121211000010211), we get a palindrome (233221000122332).
The spelling of 112010000112121 in words is "one hundred twelve trillion, ten billion, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •