Base | Representation |
---|---|
bin | 11110000001010100110111… |
… | …000011100111111111101101 |
3 | 122022111011222212110010012011 |
4 | 132001110313003213333231 |
5 | 114301210041403442334 |
6 | 1144450522124441221 |
7 | 36545014523110414 |
oct | 3601246703477755 |
9 | 568434885403164 |
10 | 132032513343469 |
11 | 3908474677a202 |
12 | 129849516a9211 |
13 | 58897c6b0341b |
14 | 248659cbbc47b |
15 | 103e706b64564 |
hex | 7815370e7fed |
132032513343469 has 2 divisors, whose sum is σ = 132032513343470. Its totient is φ = 132032513343468.
The previous prime is 132032513343421. The next prime is 132032513343481. The reversal of 132032513343469 is 964343315230231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79346139446025 + 52686373897444 = 8907645^2 + 7258538^2 .
It is a cyclic number.
It is not a de Polignac number, because 132032513343469 - 213 = 132032513335277 is a prime.
It is a super-2 number, since 2×1320325133434692 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132032513943469) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66016256671734 + 66016256671735.
It is an arithmetic number, because the mean of its divisors is an integer number (66016256671735).
Almost surely, 2132032513343469 is an apocalyptic number.
It is an amenable number.
132032513343469 is a deficient number, since it is larger than the sum of its proper divisors (1).
132032513343469 is an equidigital number, since it uses as much as digits as its factorization.
132032513343469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4199040, while the sum is 49.
The spelling of 132032513343469 in words is "one hundred thirty-two trillion, thirty-two billion, five hundred thirteen million, three hundred forty-three thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •