Base | Representation |
---|---|
bin | 11001000000111000110001… |
… | …010110001001101011010011 |
3 | 112102112001111210212020202121 |
4 | 121000320301112021223103 |
5 | 103404414310233211011 |
6 | 1025550511553555111 |
7 | 32113053615561256 |
oct | 3100706126115323 |
9 | 472461453766677 |
10 | 110012120210131 |
11 | 32064972937487 |
12 | 10409104575a97 |
13 | 4950138304729 |
14 | 1d248878d109d |
15 | caba037cae71 |
hex | 640e31589ad3 |
110012120210131 has 2 divisors, whose sum is σ = 110012120210132. Its totient is φ = 110012120210130.
The previous prime is 110012120210089. The next prime is 110012120210173. The reversal of 110012120210131 is 131012021210011.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (110012120210089) and next prime (110012120210173).
It is a cyclic number.
It is not a de Polignac number, because 110012120210131 - 221 = 110012118112979 is a prime.
It is a super-2 number, since 2×1100121202101312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110012120210231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55006060105065 + 55006060105066.
It is an arithmetic number, because the mean of its divisors is an integer number (55006060105066).
Almost surely, 2110012120210131 is an apocalyptic number.
110012120210131 is a deficient number, since it is larger than the sum of its proper divisors (1).
110012120210131 is an equidigital number, since it uses as much as digits as its factorization.
110012120210131 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 16.
Adding to 110012120210131 its reverse (131012021210011), we get a palindrome (241024141420142).
The spelling of 110012120210131 in words is "one hundred ten trillion, twelve billion, one hundred twenty million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •