Base | Representation |
---|---|
bin | 1110110001100110100111… |
… | …00011110001011110101111 |
3 | 11021001002010111021201220001 |
4 | 13120303103203301132233 |
5 | 13224311404042402411 |
6 | 153034002510205131 |
7 | 6562242250143043 |
oct | 730632343613657 |
9 | 137032114251801 |
10 | 32490681997231 |
11 | a397247a589a7 |
12 | 3788ab37b37a7 |
13 | 1518b2050bc83 |
14 | 8047b370a023 |
15 | 3b5255844dc1 |
hex | 1d8cd38f17af |
32490681997231 has 2 divisors, whose sum is σ = 32490681997232. Its totient is φ = 32490681997230.
The previous prime is 32490681997217. The next prime is 32490681997237. The reversal of 32490681997231 is 13279918609423.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 32490681997231 - 213 = 32490681989039 is a prime.
It is a super-2 number, since 2×324906819972312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32490681997237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16245340998615 + 16245340998616.
It is an arithmetic number, because the mean of its divisors is an integer number (16245340998616).
Almost surely, 232490681997231 is an apocalyptic number.
32490681997231 is a deficient number, since it is larger than the sum of its proper divisors (1).
32490681997231 is an equidigital number, since it uses as much as digits as its factorization.
32490681997231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35271936, while the sum is 64.
The spelling of 32490681997231 in words is "thirty-two trillion, four hundred ninety billion, six hundred eighty-one million, nine hundred ninety-seven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •