Base | Representation |
---|---|
bin | 11101111111010101… |
… | …000111011110100101 |
3 | 10002010010212221210221 |
4 | 131333111013132211 |
5 | 1011421424410112 |
6 | 22443135244341 |
7 | 2216654044555 |
oct | 357725073645 |
9 | 102103787727 |
10 | 32201013157 |
11 | 127246a5875 |
12 | 62a80796b1 |
13 | 306238c951 |
14 | 17b68ab165 |
15 | c86e95e07 |
hex | 77f5477a5 |
32201013157 has 2 divisors, whose sum is σ = 32201013158. Its totient is φ = 32201013156.
The previous prime is 32201013113. The next prime is 32201013203. The reversal of 32201013157 is 75131010223.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22740338401 + 9460674756 = 150799^2 + 97266^2 .
It is a cyclic number.
It is not a de Polignac number, because 32201013157 - 219 = 32200488869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32201023157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16100506578 + 16100506579.
It is an arithmetic number, because the mean of its divisors is an integer number (16100506579).
Almost surely, 232201013157 is an apocalyptic number.
It is an amenable number.
32201013157 is a deficient number, since it is larger than the sum of its proper divisors (1).
32201013157 is an equidigital number, since it uses as much as digits as its factorization.
32201013157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 25.
The spelling of 32201013157 in words is "thirty-two billion, two hundred one million, thirteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •