Base | Representation |
---|---|
bin | 10100101100100001101… |
… | …111001110100001000011 |
3 | 12000221221120120222021212 |
4 | 110230201233032201003 |
5 | 141300131223001311 |
6 | 3005203314040335 |
7 | 204515306160635 |
oct | 24544157164103 |
9 | 5027846528255 |
10 | 1422200203331 |
11 | 4a9173a35676 |
12 | 1ab76bb790ab |
13 | a416108486b |
14 | 4cb98bc2a55 |
15 | 26edc137c8b |
hex | 14b21bce843 |
1422200203331 has 2 divisors, whose sum is σ = 1422200203332. Its totient is φ = 1422200203330.
The previous prime is 1422200203199. The next prime is 1422200203349. The reversal of 1422200203331 is 1333020022241.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1422200203331 - 234 = 1405020334147 is a prime.
It is a super-2 number, since 2×14222002033312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1422200203297 and 1422200203306.
It is not a weakly prime, because it can be changed into another prime (1422200203531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 711100101665 + 711100101666.
It is an arithmetic number, because the mean of its divisors is an integer number (711100101666).
Almost surely, 21422200203331 is an apocalyptic number.
1422200203331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1422200203331 is an equidigital number, since it uses as much as digits as its factorization.
1422200203331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 1422200203331 its reverse (1333020022241), we get a palindrome (2755220225572).
The spelling of 1422200203331 in words is "one trillion, four hundred twenty-two billion, two hundred million, two hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •