Base | Representation |
---|---|
bin | 11110000011000010111000… |
… | …101001001010001011000111 |
3 | 122022220110221010100100210021 |
4 | 132003002320221022023013 |
5 | 114310124013244420042 |
6 | 1145021100552440011 |
7 | 36556366224304516 |
oct | 3603027051121307 |
9 | 568813833310707 |
10 | 132150651560647 |
11 | 3911a85a711335 |
12 | 129a38219a9007 |
13 | 58979a3378145 |
14 | 248c1a8b6867d |
15 | 104281d45a867 |
hex | 7830b8a4a2c7 |
132150651560647 has 2 divisors, whose sum is σ = 132150651560648. Its totient is φ = 132150651560646.
The previous prime is 132150651560611. The next prime is 132150651560663. The reversal of 132150651560647 is 746065156051231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132150651560647 - 235 = 132116291822279 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132150651560594 and 132150651560603.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132150651563647) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66075325780323 + 66075325780324.
It is an arithmetic number, because the mean of its divisors is an integer number (66075325780324).
Almost surely, 2132150651560647 is an apocalyptic number.
132150651560647 is a deficient number, since it is larger than the sum of its proper divisors (1).
132150651560647 is an equidigital number, since it uses as much as digits as its factorization.
132150651560647 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536000, while the sum is 52.
The spelling of 132150651560647 in words is "one hundred thirty-two trillion, one hundred fifty billion, six hundred fifty-one million, five hundred sixty thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •