Base | Representation |
---|---|
bin | 11110000100010011011100… |
… | …110110001111000101000101 |
3 | 122100012202012221001202210121 |
4 | 132010103130312033011011 |
5 | 114313033200012024214 |
6 | 1145124524544421541 |
7 | 36565551025500436 |
oct | 3604233466170505 |
9 | 570182187052717 |
10 | 132237158314309 |
11 | 391535114a8784 |
12 | 129b85449178b1 |
13 | 58a2bab556b49 |
14 | 2492453b4548d |
15 | 1044bd2cb1424 |
hex | 7844dcd8f145 |
132237158314309 has 2 divisors, whose sum is σ = 132237158314310. Its totient is φ = 132237158314308.
The previous prime is 132237158314241. The next prime is 132237158314399. The reversal of 132237158314309 is 903413851732231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95822993922084 + 36414164392225 = 9788922^2 + 6034415^2 .
It is a cyclic number.
It is not a de Polignac number, because 132237158314309 - 217 = 132237158183237 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132237158314399) 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, 66118579157154 + 66118579157155.
It is an arithmetic number, because the mean of its divisors is an integer number (66118579157155).
Almost surely, 2132237158314309 is an apocalyptic number.
It is an amenable number.
132237158314309 is a deficient number, since it is larger than the sum of its proper divisors (1).
132237158314309 is an equidigital number, since it uses as much as digits as its factorization.
132237158314309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3265920, while the sum is 52.
The spelling of 132237158314309 in words is "one hundred thirty-two trillion, two hundred thirty-seven billion, one hundred fifty-eight million, three hundred fourteen thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •