Base | Representation |
---|---|
bin | 110010000100010110001100… |
… | …010011111000100100110011 |
3 | 1001212200000100112212121100221 |
4 | 302010112030103320210303 |
5 | 212330233203233240311 |
6 | 2100154542511553511 |
7 | 64244666600021545 |
oct | 6204261423704463 |
9 | 1055600315777327 |
10 | 220201032321331 |
11 | 64187808130906 |
12 | 2084452822b897 |
13 | 95b3b397076b9 |
14 | 3c53b030c5695 |
15 | 1a6ce02d12671 |
hex | c8458c4f8933 |
220201032321331 has 2 divisors, whose sum is σ = 220201032321332. Its totient is φ = 220201032321330.
The previous prime is 220201032321323. The next prime is 220201032321409. The reversal of 220201032321331 is 133123230102022.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 220201032321331 - 23 = 220201032321323 is a prime.
It is a super-2 number, since 2×2202010323213312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 220201032321296 and 220201032321305.
It is not a weakly prime, because it can be changed into another prime (220201032321631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110100516160665 + 110100516160666.
It is an arithmetic number, because the mean of its divisors is an integer number (110100516160666).
Almost surely, 2220201032321331 is an apocalyptic number.
220201032321331 is a deficient number, since it is larger than the sum of its proper divisors (1).
220201032321331 is an equidigital number, since it uses as much as digits as its factorization.
220201032321331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 220201032321331 its reverse (133123230102022), we get a palindrome (353324262423353).
The spelling of 220201032321331 in words is "two hundred twenty trillion, two hundred one billion, thirty-two million, three hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •