Base | Representation |
---|---|
bin | 111101100100110001… |
… | …0101001001001000101 |
3 | 110122022100200021110112 |
4 | 1323021202221021011 |
5 | 4131301430230314 |
6 | 140425030402405 |
7 | 12360535116044 |
oct | 1731142511105 |
9 | 418270607415 |
10 | 132230320709 |
11 | 51095629093 |
12 | 21763800405 |
13 | c613c91126 |
14 | 658579a55b |
15 | 368da6e43e |
hex | 1ec98a9245 |
132230320709 has 2 divisors, whose sum is σ = 132230320710. Its totient is φ = 132230320708.
The previous prime is 132230320661. The next prime is 132230320711. The reversal of 132230320709 is 907023032231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 132157696225 + 72624484 = 363535^2 + 8522^2 .
It is an emirp because it is prime and its reverse (907023032231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132230320709 - 236 = 63510843973 is a prime.
Together with 132230320711, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132230320009) 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, 66115160354 + 66115160355.
It is an arithmetic number, because the mean of its divisors is an integer number (66115160355).
Almost surely, 2132230320709 is an apocalyptic number.
It is an amenable number.
132230320709 is a deficient number, since it is larger than the sum of its proper divisors (1).
132230320709 is an equidigital number, since it uses as much as digits as its factorization.
132230320709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 32.
The spelling of 132230320709 in words is "one hundred thirty-two billion, two hundred thirty million, three hundred twenty thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •