Base | Representation |
---|---|
bin | 110010000001100100011000… |
… | …011101000100101011011011 |
3 | 1001211222202112211212101121121 |
4 | 302001210120131010223123 |
5 | 212314121201130341443 |
6 | 2055531125500150111 |
7 | 64225130424123424 |
oct | 6201443035045333 |
9 | 1054882484771547 |
10 | 220010110012123 |
11 | 641138444a5102 |
12 | 20813524838337 |
13 | 959bb30c9aac2 |
14 | 3c4879088064b |
15 | 1a67e7b7b44ed |
hex | c81918744adb |
220010110012123 has 2 divisors, whose sum is σ = 220010110012124. Its totient is φ = 220010110012122.
The previous prime is 220010110011997. The next prime is 220010110012139. The reversal of 220010110012123 is 321210011010022.
It is an a-pointer prime, because the next prime (220010110012139) can be obtained adding 220010110012123 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 220010110012123 - 233 = 220001520077531 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220010110012097 and 220010110012106.
It is not a weakly prime, because it can be changed into another prime (220010110012153) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110005055006061 + 110005055006062.
It is an arithmetic number, because the mean of its divisors is an integer number (110005055006062).
Almost surely, 2220010110012123 is an apocalyptic number.
220010110012123 is a deficient number, since it is larger than the sum of its proper divisors (1).
220010110012123 is an equidigital number, since it uses as much as digits as its factorization.
220010110012123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 220010110012123 its reverse (321210011010022), we get a palindrome (541220121022145).
The spelling of 220010110012123 in words is "two hundred twenty trillion, ten billion, one hundred ten million, twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •