Base | Representation |
---|---|
bin | 11101111001111010… |
… | …011011101111110101 |
3 | 10001212210212201121001 |
4 | 131321322123233311 |
5 | 1011230143212323 |
6 | 22430131323301 |
7 | 2214501422545 |
oct | 357172335765 |
9 | 101783781531 |
10 | 32110132213 |
11 | 12688372655 |
12 | 6281750531 |
13 | 30495bca43 |
14 | 17a87b1325 |
15 | c7dee33ad |
hex | 779e9bbf5 |
32110132213 has 2 divisors, whose sum is σ = 32110132214. Its totient is φ = 32110132212.
The previous prime is 32110132189. The next prime is 32110132291. The reversal of 32110132213 is 31223101123.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16439599089 + 15670533124 = 128217^2 + 125182^2 .
It is an emirp because it is prime and its reverse (31223101123) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32110132213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32110132913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16055066106 + 16055066107.
It is an arithmetic number, because the mean of its divisors is an integer number (16055066107).
Almost surely, 232110132213 is an apocalyptic number.
It is an amenable number.
32110132213 is a deficient number, since it is larger than the sum of its proper divisors (1).
32110132213 is an equidigital number, since it uses as much as digits as its factorization.
32110132213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 32110132213 its reverse (31223101123), we get a palindrome (63333233336).
The spelling of 32110132213 in words is "thirty-two billion, one hundred ten million, one hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •