Base | Representation |
---|---|
bin | 11110000101011000001110… |
… | …111000001001011110101001 |
3 | 122100110210211221000211220102 |
4 | 132011120032320021132221 |
5 | 114320240423100323424 |
6 | 1145222501224035145 |
7 | 36604104136465556 |
oct | 3605301670113651 |
9 | 570423757024812 |
10 | 132311012120489 |
11 | 39181870001434 |
12 | 12a0a916302ab5 |
13 | 58a9b4b227587 |
14 | 2495c5c4d7a2d |
15 | 1046aa68ba7ae |
hex | 78560ee097a9 |
132311012120489 has 2 divisors, whose sum is σ = 132311012120490. Its totient is φ = 132311012120488.
The previous prime is 132311012120377. The next prime is 132311012120501. The reversal of 132311012120489 is 984021210113231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106896306430489 + 25414705690000 = 10339067^2 + 5041300^2 .
It is a cyclic number.
It is not a de Polignac number, because 132311012120489 - 240 = 131211500492713 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (132311012120689) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66155506060244 + 66155506060245.
It is an arithmetic number, because the mean of its divisors is an integer number (66155506060245).
Almost surely, 2132311012120489 is an apocalyptic number.
It is an amenable number.
132311012120489 is a deficient number, since it is larger than the sum of its proper divisors (1).
132311012120489 is an equidigital number, since it uses as much as digits as its factorization.
132311012120489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 38.
The spelling of 132311012120489 in words is "one hundred thirty-two trillion, three hundred eleven billion, twelve million, one hundred twenty thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •