Base | Representation |
---|---|
bin | 11110000011000110111011… |
… | …111001000010100000101011 |
3 | 122022220220011020121220210021 |
4 | 132003012323321002200223 |
5 | 114310211420230210012 |
6 | 1145023100324501311 |
7 | 36556612060154401 |
oct | 3603067371024053 |
9 | 568826136556707 |
10 | 132155001022507 |
11 | 39121691892411 |
12 | 129a463654a837 |
13 | 58982174c4b08 |
14 | 248c49c689471 |
15 | 10429c5210007 |
hex | 7831bbe4282b |
132155001022507 has 2 divisors, whose sum is σ = 132155001022508. Its totient is φ = 132155001022506.
The previous prime is 132155001022493. The next prime is 132155001022601. The reversal of 132155001022507 is 705220100551231.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 132155001022507 - 211 = 132155001020459 is a prime.
It is not a weakly prime, because it can be changed into another prime (132155001022207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66077500511253 + 66077500511254.
It is an arithmetic number, because the mean of its divisors is an integer number (66077500511254).
Almost surely, 2132155001022507 is an apocalyptic number.
132155001022507 is a deficient number, since it is larger than the sum of its proper divisors (1).
132155001022507 is an equidigital number, since it uses as much as digits as its factorization.
132155001022507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21000, while the sum is 34.
Adding to 132155001022507 its reverse (705220100551231), we get a palindrome (837375101573738).
The spelling of 132155001022507 in words is "one hundred thirty-two trillion, one hundred fifty-five billion, one million, twenty-two thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.150 sec. • engine limits •