Base | Representation |
---|---|
bin | 1100110100010100000… |
… | …1010011010011101111 |
3 | 210001101012121010010022 |
4 | 3031011001103103233 |
5 | 12101433013114411 |
6 | 245054210032355 |
7 | 21623536114652 |
oct | 3150501232357 |
9 | 701335533108 |
10 | 220201301231 |
11 | 8542899187a |
12 | 36814b786bb |
13 | 179c3618462 |
14 | a92d007899 |
15 | 5adbc04edb |
hex | 33450534ef |
220201301231 has 2 divisors, whose sum is σ = 220201301232. Its totient is φ = 220201301230.
The previous prime is 220201301209. The next prime is 220201301279. The reversal of 220201301231 is 132103102022.
220201301231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220201301231 is a prime.
It is a super-2 number, since 2×2202013012312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220201304231) 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, 110100650615 + 110100650616.
It is an arithmetic number, because the mean of its divisors is an integer number (110100650616).
Almost surely, 2220201301231 is an apocalyptic number.
220201301231 is a deficient number, since it is larger than the sum of its proper divisors (1).
220201301231 is an equidigital number, since it uses as much as digits as its factorization.
220201301231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 220201301231 its reverse (132103102022), we get a palindrome (352304403253).
The spelling of 220201301231 in words is "two hundred twenty billion, two hundred one million, three hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •