Base | Representation |
---|---|
bin | 10001110001001001111… |
… | …111100011101011000111 |
3 | 11022201122102200220011121 |
4 | 101301021333203223013 |
5 | 130001113100010043 |
6 | 2332531503014411 |
7 | 154133550456016 |
oct | 21611177435307 |
9 | 4281572626147 |
10 | 1221012110023 |
11 | 430912560382 |
12 | 17878259a407 |
13 | 8b1aa87c8c4 |
14 | 43150dd0a7d |
15 | 21b6472aded |
hex | 11c49fe3ac7 |
1221012110023 has 2 divisors, whose sum is σ = 1221012110024. Its totient is φ = 1221012110022.
The previous prime is 1221012109979. The next prime is 1221012110029. The reversal of 1221012110023 is 3200112101221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1221012110023 - 29 = 1221012109511 is a prime.
It is a super-3 number, since 3×12210121100233 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1221012109979 and 1221012110006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1221012110029) 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, 610506055011 + 610506055012.
It is an arithmetic number, because the mean of its divisors is an integer number (610506055012).
Almost surely, 21221012110023 is an apocalyptic number.
1221012110023 is a deficient number, since it is larger than the sum of its proper divisors (1).
1221012110023 is an equidigital number, since it uses as much as digits as its factorization.
1221012110023 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 1221012110023 its reverse (3200112101221), we get a palindrome (4421124211244).
The spelling of 1221012110023 in words is "one trillion, two hundred twenty-one billion, twelve million, one hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •