Base | Representation |
---|---|
bin | 11110000011000011010101… |
… | …001010110110011010101111 |
3 | 122022220112011110220110100212 |
4 | 132003003111022312122233 |
5 | 114310131003304422141 |
6 | 1145021220250413035 |
7 | 36556414125265415 |
oct | 3603032512663257 |
9 | 568815143813325 |
10 | 132151130154671 |
11 | 3911aa85888091 |
12 | 129a393613117b |
13 | 5897a4b576b84 |
14 | 248c21254b2b5 |
15 | 104284a4962eb |
hex | 7830d52b66af |
132151130154671 has 2 divisors, whose sum is σ = 132151130154672. Its totient is φ = 132151130154670.
The previous prime is 132151130154643. The next prime is 132151130154683. The reversal of 132151130154671 is 176451031151231.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132151130154671 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132151130154271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66075565077335 + 66075565077336.
It is an arithmetic number, because the mean of its divisors is an integer number (66075565077336).
Almost surely, 2132151130154671 is an apocalyptic number.
132151130154671 is a deficient number, since it is larger than the sum of its proper divisors (1).
132151130154671 is an equidigital number, since it uses as much as digits as its factorization.
132151130154671 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75600, while the sum is 41.
The spelling of 132151130154671 in words is "one hundred thirty-two trillion, one hundred fifty-one billion, one hundred thirty million, one hundred fifty-four thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •