Base | Representation |
---|---|
bin | 11110000011000101010110… |
… | …101011110001010010001011 |
3 | 122022220201202220120201220001 |
4 | 132003011112223301102023 |
5 | 114310144431034422014 |
6 | 1145022220031143431 |
7 | 36556522021455406 |
oct | 3603052653612213 |
9 | 568821686521801 |
10 | 132153303045259 |
11 | 391209a0380a31 |
12 | 129a4241974b77 |
13 | 58980067a6152 |
14 | 248c37ad6cd3d |
15 | 104292610a974 |
hex | 783156af148b |
132153303045259 has 2 divisors, whose sum is σ = 132153303045260. Its totient is φ = 132153303045258.
The previous prime is 132153303045173. The next prime is 132153303045319. The reversal of 132153303045259 is 952540303351231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132153303045259 - 211 = 132153303043211 is a prime.
It is not a weakly prime, because it can be changed into another prime (132153303045359) 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, 66076651522629 + 66076651522630.
It is an arithmetic number, because the mean of its divisors is an integer number (66076651522630).
Almost surely, 2132153303045259 is an apocalyptic number.
132153303045259 is a deficient number, since it is larger than the sum of its proper divisors (1).
132153303045259 is an equidigital number, since it uses as much as digits as its factorization.
132153303045259 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458000, while the sum is 46.
The spelling of 132153303045259 in words is "one hundred thirty-two trillion, one hundred fifty-three billion, three hundred three million, forty-five thousand, two hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •