Base | Representation |
---|---|
bin | 1101100001011001000… |
… | …1111000111000111001 |
3 | 211012121112020102200001 |
4 | 3120112101320320321 |
5 | 12301223304202301 |
6 | 254415034313001 |
7 | 22532442415564 |
oct | 3302621707071 |
9 | 735545212601 |
10 | 232302022201 |
11 | 8a578487617 |
12 | 39031588761 |
13 | 18ba15b6992 |
14 | b35a1634db |
15 | 609921dc01 |
hex | 3616478e39 |
232302022201 has 2 divisors, whose sum is σ = 232302022202. Its totient is φ = 232302022200.
The previous prime is 232302022177. The next prime is 232302022231. The reversal of 232302022201 is 102220203232.
232302022201 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 can be written as a sum of positive squares in only one way, i.e., 125386101801 + 106915920400 = 354099^2 + 326980^2 .
It is a cyclic number.
It is not a de Polignac number, because 232302022201 - 231 = 230154538553 is a prime.
It is not a weakly prime, because it can be changed into another prime (232302022231) 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, 116151011100 + 116151011101.
It is an arithmetic number, because the mean of its divisors is an integer number (116151011101).
Almost surely, 2232302022201 is an apocalyptic number.
It is an amenable number.
232302022201 is a deficient number, since it is larger than the sum of its proper divisors (1).
232302022201 is an equidigital number, since it uses as much as digits as its factorization.
232302022201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 232302022201 its reverse (102220203232), we get a palindrome (334522225433).
The spelling of 232302022201 in words is "two hundred thirty-two billion, three hundred two million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •