Base | Representation |
---|---|
bin | 11110000011000101101001… |
… | …110001111001111010000111 |
3 | 122022220202121020102111011121 |
4 | 132003011221301321322013 |
5 | 114310201110043424201 |
6 | 1145022311514014411 |
7 | 36556532661556225 |
oct | 3603055161717207 |
9 | 568822536374147 |
10 | 132153623420551 |
11 | 391210452016a7 |
12 | 129a4311117407 |
13 | 5898057c89125 |
14 | 248c3ab727b15 |
15 | 10429442e19a1 |
hex | 783169c79e87 |
132153623420551 has 16 divisors (see below), whose sum is σ = 138444433763328. Its totient is φ = 125908289689600.
The previous prime is 132153623420477. The next prime is 132153623420557. The reversal of 132153623420551 is 155024326351231.
It is a cyclic number.
It is not a de Polignac number, because 132153623420551 - 213 = 132153623412359 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132153623420498 and 132153623420507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132153623420557) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 97633686 + ... + 98977996.
It is an arithmetic number, because the mean of its divisors is an integer number (8652777110208).
Almost surely, 2132153623420551 is an apocalyptic number.
132153623420551 is a deficient number, since it is larger than the sum of its proper divisors (6290810342777).
132153623420551 is a wasteful number, since it uses less digits than its factorization.
132153623420551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1361222.
The product of its (nonzero) digits is 648000, while the sum is 43.
Adding to 132153623420551 its reverse (155024326351231), we get a palindrome (287177949771782).
The spelling of 132153623420551 in words is "one hundred thirty-two trillion, one hundred fifty-three billion, six hundred twenty-three million, four hundred twenty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •