Base | Representation |
---|---|
bin | 11110000011000010101111… |
… | …111111110110111101000011 |
3 | 122022220110120000102100100002 |
4 | 132003002233333312331003 |
5 | 114310123214132010131 |
6 | 1145021034331550215 |
7 | 36556362513404624 |
oct | 3603025777667503 |
9 | 568813500370302 |
10 | 132150506516291 |
11 | 3911a79585436a |
12 | 129a37a12bb36b |
13 | 589797c2c2a93 |
14 | 248c1937ada4b |
15 | 10428108596cb |
hex | 7830afff6f43 |
132150506516291 has 2 divisors, whose sum is σ = 132150506516292. Its totient is φ = 132150506516290.
The previous prime is 132150506516239. The next prime is 132150506516387. The reversal of 132150506516291 is 192615605051231.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132150506516291 is a prime.
It is not a weakly prime, because it can be changed into another prime (132150506546291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66075253258145 + 66075253258146.
It is an arithmetic number, because the mean of its divisors is an integer number (66075253258146).
Almost surely, 2132150506516291 is an apocalyptic number.
132150506516291 is a deficient number, since it is larger than the sum of its proper divisors (1).
132150506516291 is an equidigital number, since it uses as much as digits as its factorization.
132150506516291 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486000, while the sum is 47.
The spelling of 132150506516291 in words is "one hundred thirty-two trillion, one hundred fifty billion, five hundred six million, five hundred sixteen thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •