Base | Representation |
---|---|
bin | 10001110001001111111… |
… | …001001101100101110011 |
3 | 11022201220022222121121112 |
4 | 101301033321031211303 |
5 | 130001313421010003 |
6 | 2332545400543535 |
7 | 154136162114501 |
oct | 21611771154563 |
9 | 4281808877545 |
10 | 1221111110003 |
11 | 430963429544 |
12 | 1787ab781bab |
13 | 8b1c5233185 |
14 | 43160201671 |
15 | 21b6d2843d8 |
hex | 11c4fe4d973 |
1221111110003 has 2 divisors, whose sum is σ = 1221111110004. Its totient is φ = 1221111110002.
The previous prime is 1221111109987. The next prime is 1221111110027. The reversal of 1221111110003 is 3000111111221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1221111110003 - 24 = 1221111109987 is a prime.
It is a super-2 number, since 2×12211111100032 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1221111110003.
It is not a weakly prime, because it can be changed into another prime (1221111112003) 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, 610555555001 + 610555555002.
It is an arithmetic number, because the mean of its divisors is an integer number (610555555002).
Almost surely, 21221111110003 is an apocalyptic number.
1221111110003 is a deficient number, since it is larger than the sum of its proper divisors (1).
1221111110003 is an equidigital number, since it uses as much as digits as its factorization.
1221111110003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1221111110003 its reverse (3000111111221), we get a palindrome (4221222221224).
The spelling of 1221111110003 in words is "one trillion, two hundred twenty-one billion, one hundred eleven million, one hundred ten thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •