Base | Representation |
---|---|
bin | 10001110001010110011… |
… | …001010111001100001111 |
3 | 11022202011221021000122101 |
4 | 101301112121113030033 |
5 | 130002024332414411 |
6 | 2333004255055531 |
7 | 154141655302642 |
oct | 21612631271417 |
9 | 4282157230571 |
10 | 1221220201231 |
11 | 430a09a6a388 |
12 | 1788202115a7 |
13 | 8b211a0a9b4 |
14 | 431708bba59 |
15 | 21b77b328c1 |
hex | 11c5665730f |
1221220201231 has 2 divisors, whose sum is σ = 1221220201232. Its totient is φ = 1221220201230.
The previous prime is 1221220201219. The next prime is 1221220201237. The reversal of 1221220201231 is 1321020221221.
It is a strong prime.
It is an emirp because it is prime and its reverse (1321020221221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1221220201231 - 25 = 1221220201199 is a prime.
It is a super-2 number, since 2×12212202012312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1221220201199 and 1221220201208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1221220201237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610610100615 + 610610100616.
It is an arithmetic number, because the mean of its divisors is an integer number (610610100616).
Almost surely, 21221220201231 is an apocalyptic number.
1221220201231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1221220201231 is an equidigital number, since it uses as much as digits as its factorization.
1221220201231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 1221220201231 its reverse (1321020221221), we get a palindrome (2542240422452).
The spelling of 1221220201231 in words is "one trillion, two hundred twenty-one billion, two hundred twenty million, two hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •