Base | Representation |
---|---|
bin | 1110101100111011010111… |
… | …11101110110101111010101 |
3 | 11020110201110101121120112012 |
4 | 13112131223331312233111 |
5 | 13214143400213322401 |
6 | 152432113313034005 |
7 | 6544524200415344 |
oct | 726355375665725 |
9 | 136421411546465 |
10 | 32330030214101 |
11 | a3350a82394a4 |
12 | 3761939855905 |
13 | 150692a215879 |
14 | 7daad340db5b |
15 | 3b0ea1a5b8bb |
hex | 1d676bf76bd5 |
32330030214101 has 2 divisors, whose sum is σ = 32330030214102. Its totient is φ = 32330030214100.
The previous prime is 32330030214089. The next prime is 32330030214127. The reversal of 32330030214101 is 10141203003323.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31747252180900 + 582778033201 = 5634470^2 + 763399^2 .
It is a cyclic number.
It is not a de Polignac number, because 32330030214101 - 26 = 32330030214037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32330030217101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16165015107050 + 16165015107051.
It is an arithmetic number, because the mean of its divisors is an integer number (16165015107051).
Almost surely, 232330030214101 is an apocalyptic number.
It is an amenable number.
32330030214101 is a deficient number, since it is larger than the sum of its proper divisors (1).
32330030214101 is an equidigital number, since it uses as much as digits as its factorization.
32330030214101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 32330030214101 its reverse (10141203003323), we get a palindrome (42471233217424).
The spelling of 32330030214101 in words is "thirty-two trillion, three hundred thirty billion, thirty million, two hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •