Base | Representation |
---|---|
bin | 11110000011000011100000… |
… | …000100100100001010010011 |
3 | 122022220112122020001211101002 |
4 | 132003003200010210022103 |
5 | 114310131342120301103 |
6 | 1145021250342532215 |
7 | 36556421506030544 |
oct | 3603034004441223 |
9 | 568815566054332 |
10 | 132151313056403 |
11 | 3912006a051943 |
12 | 129a398743706b |
13 | 5897a7a425754 |
14 | 248c22c95c4cb |
15 | 104285b574488 |
hex | 7830e0124293 |
132151313056403 has 2 divisors, whose sum is σ = 132151313056404. Its totient is φ = 132151313056402.
The previous prime is 132151313056379. The next prime is 132151313056417. The reversal of 132151313056403 is 304650313151231.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 132151313056403 - 210 = 132151313055379 is a prime.
It is not a weakly prime, because it can be changed into another prime (132151313056703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66075656528201 + 66075656528202.
It is an arithmetic number, because the mean of its divisors is an integer number (66075656528202).
Almost surely, 2132151313056403 is an apocalyptic number.
132151313056403 is a deficient number, since it is larger than the sum of its proper divisors (1).
132151313056403 is an equidigital number, since it uses as much as digits as its factorization.
132151313056403 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 97200, while the sum is 38.
The spelling of 132151313056403 in words is "one hundred thirty-two trillion, one hundred fifty-one billion, three hundred thirteen million, fifty-six thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •