Base | Representation |
---|---|
bin | 111101011110001101… |
… | …1101101111011110111 |
3 | 110121202000212020001122 |
4 | 1322330123231323313 |
5 | 4130324130322102 |
6 | 140351133014155 |
7 | 12352224620204 |
oct | 1727433557367 |
9 | 417660766048 |
10 | 132010401527 |
11 | 50a924805a4 |
12 | 2170202435b |
13 | c5aa551434 |
14 | 65644b0cab |
15 | 36795cd0a2 |
hex | 1ebc6edef7 |
132010401527 has 2 divisors, whose sum is σ = 132010401528. Its totient is φ = 132010401526.
The previous prime is 132010401487. The next prime is 132010401533. The reversal of 132010401527 is 725104010231.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132010401527 is a prime.
It is a super-2 number, since 2×1320104015272 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132010401496 and 132010401505.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132010403527) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66005200763 + 66005200764.
It is an arithmetic number, because the mean of its divisors is an integer number (66005200764).
Almost surely, 2132010401527 is an apocalyptic number.
132010401527 is a deficient number, since it is larger than the sum of its proper divisors (1).
132010401527 is an equidigital number, since it uses as much as digits as its factorization.
132010401527 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 26.
Adding to 132010401527 its reverse (725104010231), we get a palindrome (857114411758).
The spelling of 132010401527 in words is "one hundred thirty-two billion, ten million, four hundred one thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •