Base | Representation |
---|---|
bin | 11101111111010101… |
… | …011111111100110001 |
3 | 10002010011002001022101 |
4 | 131333111133330301 |
5 | 1011421441112033 |
6 | 22443141340401 |
7 | 2216654643031 |
oct | 357725377461 |
9 | 102104061271 |
10 | 32201113393 |
11 | 12724764109 |
12 | 62a8107701 |
13 | 30623c6467 |
14 | 17b68d58c1 |
15 | c86eb597d |
hex | 77f55ff31 |
32201113393 has 2 divisors, whose sum is σ = 32201113394. Its totient is φ = 32201113392.
The previous prime is 32201113391. The next prime is 32201113459. The reversal of 32201113393 is 39331110223.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29101630464 + 3099482929 = 170592^2 + 55673^2 .
It is a cyclic number.
It is not a de Polignac number, because 32201113393 - 21 = 32201113391 is a prime.
Together with 32201113391, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (32201113391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16100556696 + 16100556697.
It is an arithmetic number, because the mean of its divisors is an integer number (16100556697).
Almost surely, 232201113393 is an apocalyptic number.
It is an amenable number.
32201113393 is a deficient number, since it is larger than the sum of its proper divisors (1).
32201113393 is an equidigital number, since it uses as much as digits as its factorization.
32201113393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 28.
The spelling of 32201113393 in words is "thirty-two billion, two hundred one million, one hundred thirteen thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •