Base | Representation |
---|---|
bin | 11110001010010111110011… |
… | …001001010010101001000101 |
3 | 122101200121112101122101000221 |
4 | 132022113303021102221011 |
5 | 114341401141411023401 |
6 | 1150044250024104341 |
7 | 36640642233366355 |
oct | 3612276311225105 |
9 | 571617471571027 |
10 | 132654144236101 |
11 | 392a4341153574 |
12 | 12a653186050b1 |
13 | 5903302c99687 |
14 | 24a86cdba0b65 |
15 | 105098aa007a1 |
hex | 78a5f3252a45 |
132654144236101 has 2 divisors, whose sum is σ = 132654144236102. Its totient is φ = 132654144236100.
The previous prime is 132654144236051. The next prime is 132654144236153. The reversal of 132654144236101 is 101632441456231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 123243968340900 + 9410175895201 = 11101530^2 + 3067601^2 .
It is a cyclic number.
It is not a de Polignac number, because 132654144236101 - 231 = 132651996752453 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132654144236171) 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, 66327072118050 + 66327072118051.
It is an arithmetic number, because the mean of its divisors is an integer number (66327072118051).
Almost surely, 2132654144236101 is an apocalyptic number.
It is an amenable number.
132654144236101 is a deficient number, since it is larger than the sum of its proper divisors (1).
132654144236101 is an equidigital number, since it uses as much as digits as its factorization.
132654144236101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 414720, while the sum is 43.
The spelling of 132654144236101 in words is "one hundred thirty-two trillion, six hundred fifty-four billion, one hundred forty-four million, two hundred thirty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •