Base | Representation |
---|---|
bin | 1110101010000011100000… |
… | …11001100010000000110001 |
3 | 11020010021200010112220222112 |
4 | 13111001300121202000301 |
5 | 13211034221001032124 |
6 | 152314510353415105 |
7 | 6534431110303463 |
oct | 725016031420061 |
9 | 136107603486875 |
10 | 32231320330289 |
11 | a2a725406a823 |
12 | 374678bb6a495 |
13 | 14ca528a903b2 |
14 | 7d600b85a133 |
15 | 3ad625c0d90e |
hex | 1d5070662031 |
32231320330289 has 2 divisors, whose sum is σ = 32231320330290. Its totient is φ = 32231320330288.
The previous prime is 32231320330213. The next prime is 32231320330291. The reversal of 32231320330289 is 98203302313223.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17340728208400 + 14890592121889 = 4164220^2 + 3858833^2 .
It is a cyclic number.
It is not a de Polignac number, because 32231320330289 - 240 = 31131808702513 is a prime.
Together with 32231320330291, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (32231320330889) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16115660165144 + 16115660165145.
It is an arithmetic number, because the mean of its divisors is an integer number (16115660165145).
Almost surely, 232231320330289 is an apocalyptic number.
It is an amenable number.
32231320330289 is a deficient number, since it is larger than the sum of its proper divisors (1).
32231320330289 is an equidigital number, since it uses as much as digits as its factorization.
32231320330289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 279936, while the sum is 41.
The spelling of 32231320330289 in words is "thirty-two trillion, two hundred thirty-one billion, three hundred twenty million, three hundred thirty thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •