Base | Representation |
---|---|
bin | 11110000001010101011101… |
… | …001010011010001001010001 |
3 | 122022111020122102102120001022 |
4 | 132001111131022122021101 |
5 | 114301212344034442303 |
6 | 1144451105403245225 |
7 | 36545036415142253 |
oct | 3601253512321121 |
9 | 568436572376038 |
10 | 132033152655953 |
11 | 39084a4463912a |
12 | 12984aab819815 |
13 | 58898993b4933 |
14 | 248661da79cd3 |
15 | 103e742d4a438 |
hex | 78155d29a251 |
132033152655953 has 2 divisors, whose sum is σ = 132033152655954. Its totient is φ = 132033152655952.
The previous prime is 132033152655949. The next prime is 132033152655983. The reversal of 132033152655953 is 359556251330231.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111276590707984 + 20756561947969 = 10548772^2 + 4555937^2 .
It is a cyclic number.
It is not a de Polignac number, because 132033152655953 - 22 = 132033152655949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132033152655895 and 132033152655904.
It is not a weakly prime, because it can be changed into another prime (132033152655983) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66016576327976 + 66016576327977.
It is an arithmetic number, because the mean of its divisors is an integer number (66016576327977).
Almost surely, 2132033152655953 is an apocalyptic number.
It is an amenable number.
132033152655953 is a deficient number, since it is larger than the sum of its proper divisors (1).
132033152655953 is an equidigital number, since it uses as much as digits as its factorization.
132033152655953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10935000, while the sum is 53.
The spelling of 132033152655953 in words is "one hundred thirty-two trillion, thirty-three billion, one hundred fifty-two million, six hundred fifty-five thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •