Base | Representation |
---|---|
bin | 11110000011000010110111… |
… | …101000001000100000111011 |
3 | 122022220110212221021022212011 |
4 | 132003002313220020200323 |
5 | 114310123444413430431 |
6 | 1145021055143230351 |
7 | 36556365626360335 |
oct | 3603026750104073 |
9 | 568813787238764 |
10 | 132150634514491 |
11 | 3911a8510292aa |
12 | 129a38181483b7 |
13 | 589799c98a368 |
14 | 248c1a67ac455 |
15 | 104281bbdecb1 |
hex | 7830b7a0883b |
132150634514491 has 2 divisors, whose sum is σ = 132150634514492. Its totient is φ = 132150634514490.
The previous prime is 132150634514461. The next prime is 132150634514551. The reversal of 132150634514491 is 194415436051231.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132150634514491 is a prime.
It is not a weakly prime, because it can be changed into another prime (132150634514441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66075317257245 + 66075317257246.
It is an arithmetic number, because the mean of its divisors is an integer number (66075317257246).
Almost surely, 2132150634514491 is an apocalyptic number.
132150634514491 is a deficient number, since it is larger than the sum of its proper divisors (1).
132150634514491 is an equidigital number, since it uses as much as digits as its factorization.
132150634514491 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1555200, while the sum is 49.
The spelling of 132150634514491 in words is "one hundred thirty-two trillion, one hundred fifty billion, six hundred thirty-four million, five hundred fourteen thousand, four hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.175 sec. • engine limits •