Base | Representation |
---|---|
bin | 10001110000010011101… |
… | …011111111001011001011 |
3 | 11022122021221022020001212 |
4 | 101300103223333023023 |
5 | 124442231324310443 |
6 | 2332301235003335 |
7 | 154102145320052 |
oct | 21602353771313 |
9 | 4278257266055 |
10 | 1220101010123 |
11 | 430495237556 |
12 | 17856943954b |
13 | 8b093b9ab38 |
14 | 430a5dc5399 |
15 | 21b0e75a618 |
hex | 11c13aff2cb |
1220101010123 has 2 divisors, whose sum is σ = 1220101010124. Its totient is φ = 1220101010122.
The previous prime is 1220101010119. The next prime is 1220101010137. The reversal of 1220101010123 is 3210101010221.
It is an a-pointer prime, because the next prime (1220101010137) can be obtained adding 1220101010123 to its sum of digits (14).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1220101010123 - 22 = 1220101010119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1220101010098 and 1220101010107.
It is not a weakly prime, because it can be changed into another prime (1220101510123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610050505061 + 610050505062.
It is an arithmetic number, because the mean of its divisors is an integer number (610050505062).
Almost surely, 21220101010123 is an apocalyptic number.
1220101010123 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220101010123 is an equidigital number, since it uses as much as digits as its factorization.
1220101010123 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 1220101010123 its reverse (3210101010221), we get a palindrome (4430202020344).
The spelling of 1220101010123 in words is "one trillion, two hundred twenty billion, one hundred one million, ten thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •