Base | Representation |
---|---|
bin | 10000001011101001000… |
… | …101001000101101111011 |
3 | 10221022022000202121011012 |
4 | 100023221011020231323 |
5 | 121204400033000443 |
6 | 2210503512224135 |
7 | 143224460021033 |
oct | 20135105105573 |
9 | 3838260677135 |
10 | 1112012000123 |
11 | 399668869522 |
12 | 15b62269b04b |
13 | 80b29581b5b |
14 | 3bb7092a8c3 |
15 | 1ddd52e2118 |
hex | 102e9148b7b |
1112012000123 has 2 divisors, whose sum is σ = 1112012000124. Its totient is φ = 1112012000122.
The previous prime is 1112012000119. The next prime is 1112012000173. The reversal of 1112012000123 is 3210002102111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1112012000123 - 22 = 1112012000119 is a prime.
It is a super-3 number, since 3×11120120001233 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1112012000098 and 1112012000107.
It is not a weakly prime, because it can be changed into another prime (1112012000173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556006000061 + 556006000062.
It is an arithmetic number, because the mean of its divisors is an integer number (556006000062).
Almost surely, 21112012000123 is an apocalyptic number.
1112012000123 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112012000123 is an equidigital number, since it uses as much as digits as its factorization.
1112012000123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1112012000123 its reverse (3210002102111), we get a palindrome (4322014102234).
The spelling of 1112012000123 in words is "one trillion, one hundred twelve billion, twelve million, one hundred twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •