Base | Representation |
---|---|
bin | 11110100111001100… |
… | …101111011100100101 |
3 | 10010211202112020120211 |
4 | 132213030233130211 |
5 | 1014304143444323 |
6 | 23033352055421 |
7 | 2242355410234 |
oct | 364714573445 |
9 | 103752466524 |
10 | 32869906213 |
11 | 12a38229051 |
12 | 6454094571 |
13 | 313ab2a261 |
14 | 183b668b1b |
15 | cc5a7170d |
hex | 7a732f725 |
32869906213 has 2 divisors, whose sum is σ = 32869906214. Its totient is φ = 32869906212.
The previous prime is 32869906163. The next prime is 32869906217. The reversal of 32869906213 is 31260996823.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25713084609 + 7156821604 = 160353^2 + 84598^2 .
It is a cyclic number.
It is not a de Polignac number, because 32869906213 - 29 = 32869905701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32869906217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16434953106 + 16434953107.
It is an arithmetic number, because the mean of its divisors is an integer number (16434953107).
Almost surely, 232869906213 is an apocalyptic number.
It is an amenable number.
32869906213 is a deficient number, since it is larger than the sum of its proper divisors (1).
32869906213 is an equidigital number, since it uses as much as digits as its factorization.
32869906213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 839808, while the sum is 49.
The spelling of 32869906213 in words is "thirty-two billion, eight hundred sixty-nine million, nine hundred six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •