Base | Representation |
---|---|
bin | 1001011101110010101… |
… | …10000000101100111001 |
3 | 1011002110222120121220212 |
4 | 10232321112000230321 |
5 | 20312033404232301 |
6 | 405224244400505 |
7 | 32332361153456 |
oct | 4567126005471 |
9 | 1132428517825 |
10 | 325232102201 |
11 | 115a26052126 |
12 | 530476a6135 |
13 | 2489147c1b6 |
14 | 11a5426682d |
15 | 86d792c4bb |
hex | 4bb9580b39 |
325232102201 has 2 divisors, whose sum is σ = 325232102202. Its totient is φ = 325232102200.
The previous prime is 325232102179. The next prime is 325232102203. The reversal of 325232102201 is 102201232523.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 236535349801 + 88696752400 = 486349^2 + 297820^2 .
It is a cyclic number.
It is not a de Polignac number, because 325232102201 - 210 = 325232101177 is a prime.
Together with 325232102203, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (325232102203) 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, 162616051100 + 162616051101.
It is an arithmetic number, because the mean of its divisors is an integer number (162616051101).
Almost surely, 2325232102201 is an apocalyptic number.
It is an amenable number.
325232102201 is a deficient number, since it is larger than the sum of its proper divisors (1).
325232102201 is an equidigital number, since it uses as much as digits as its factorization.
325232102201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 325232102201 its reverse (102201232523), we get a palindrome (427433334724).
The spelling of 325232102201 in words is "three hundred twenty-five billion, two hundred thirty-two million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •