Base | Representation |
---|---|
bin | 1101100001011101101… |
… | …0010111010100010001 |
3 | 211012122211222200101201 |
4 | 3120113122113110101 |
5 | 12301243140134301 |
6 | 254420553431201 |
7 | 22533063045343 |
oct | 3302732272421 |
9 | 735584880351 |
10 | 232321021201 |
11 | 8a588183875 |
12 | 39037a0b501 |
13 | 18ba55095a9 |
14 | b35c8ab293 |
15 | 609ac23201 |
hex | 3617697511 |
232321021201 has 2 divisors, whose sum is σ = 232321021202. Its totient is φ = 232321021200.
The previous prime is 232321021187. The next prime is 232321021223. The reversal of 232321021201 is 102120123232.
232321021201 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., 148206520576 + 84114500625 = 384976^2 + 290025^2 .
It is a cyclic number.
It is not a de Polignac number, because 232321021201 - 25 = 232321021169 is a prime.
It is not a weakly prime, because it can be changed into another prime (232321021001) 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, 116160510600 + 116160510601.
It is an arithmetic number, because the mean of its divisors is an integer number (116160510601).
Almost surely, 2232321021201 is an apocalyptic number.
It is an amenable number.
232321021201 is a deficient number, since it is larger than the sum of its proper divisors (1).
232321021201 is an equidigital number, since it uses as much as digits as its factorization.
232321021201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 232321021201 its reverse (102120123232), we get a palindrome (334441144433).
The spelling of 232321021201 in words is "two hundred thirty-two billion, three hundred twenty-one million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •