Base | Representation |
---|---|
bin | 110010011110110100100010… |
… | …010100000100111000001011 |
3 | 1002010002221020211211110222112 |
4 | 302132310202110010320023 |
5 | 213100040103422322311 |
6 | 2104110421011212535 |
7 | 64523303335121015 |
oct | 6236644224047013 |
9 | 1063087224743875 |
10 | 222020320120331 |
11 | 6481931a717347 |
12 | 20a99037ba714b |
13 | 96b6570905805 |
14 | 3cb7bab3471b5 |
15 | 1aa03d0d0428b |
hex | c9ed22504e0b |
222020320120331 has 2 divisors, whose sum is σ = 222020320120332. Its totient is φ = 222020320120330.
The previous prime is 222020320120297. The next prime is 222020320120363. The reversal of 222020320120331 is 133021023020222.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-222020320120331 is a prime.
It is a super-2 number, since 2×2220203201203312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 222020320120297 and 222020320120306.
It is not a weakly prime, because it can be changed into another prime (222020320120231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111010160060165 + 111010160060166.
It is an arithmetic number, because the mean of its divisors is an integer number (111010160060166).
Almost surely, 2222020320120331 is an apocalyptic number.
222020320120331 is a deficient number, since it is larger than the sum of its proper divisors (1).
222020320120331 is an equidigital number, since it uses as much as digits as its factorization.
222020320120331 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 222020320120331 its reverse (133021023020222), we get a palindrome (355041343140553).
The spelling of 222020320120331 in words is "two hundred twenty-two trillion, twenty billion, three hundred twenty million, one hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •