Base | Representation |
---|---|
bin | 11110001010010111110011… |
… | …001001010010000001001111 |
3 | 122101200121112101122020112111 |
4 | 132022113303021102001033 |
5 | 114341401141410433201 |
6 | 1150044250024044451 |
7 | 36640642233356053 |
oct | 3612276311220117 |
9 | 571617471566474 |
10 | 132654144233551 |
11 | 392a4341151666 |
12 | 12a65318603727 |
13 | 5903302c98475 |
14 | 24a86cdb9dc63 |
15 | 105098a9eeb51 |
hex | 78a5f325204f |
132654144233551 has 2 divisors, whose sum is σ = 132654144233552. Its totient is φ = 132654144233550.
The previous prime is 132654144233543. The next prime is 132654144233557. The reversal of 132654144233551 is 155332441456231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132654144233551 - 23 = 132654144233543 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132654144233495 and 132654144233504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132654144233557) 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, 66327072116775 + 66327072116776.
It is an arithmetic number, because the mean of its divisors is an integer number (66327072116776).
Almost surely, 2132654144233551 is an apocalyptic number.
132654144233551 is a deficient number, since it is larger than the sum of its proper divisors (1).
132654144233551 is an equidigital number, since it uses as much as digits as its factorization.
132654144233551 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5184000, while the sum is 49.
Adding to 132654144233551 its reverse (155332441456231), we get a palindrome (287986585689782).
The spelling of 132654144233551 in words is "one hundred thirty-two trillion, six hundred fifty-four billion, one hundred forty-four million, two hundred thirty-three thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •