Base | Representation |
---|---|
bin | 1111110001010… |
… | …11110111000011 |
3 | 100012221112210102 |
4 | 13320223313003 |
5 | 232332101402 |
6 | 21043353015 |
7 | 3164350643 |
oct | 770536703 |
9 | 305845712 |
10 | 132300227 |
11 | 68753134 |
12 | 3838276b |
13 | 21542777 |
14 | 137dc523 |
15 | b935102 |
hex | 7e2bdc3 |
132300227 has 2 divisors, whose sum is σ = 132300228. Its totient is φ = 132300226.
The previous prime is 132300199. The next prime is 132300247. The reversal of 132300227 is 722003231.
It is an a-pointer prime, because the next prime (132300247) can be obtained adding 132300227 to its sum of digits (20).
It is a strong prime.
It is an emirp because it is prime and its reverse (722003231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132300227 - 210 = 132299203 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 132300199 and 132300208.
It is not a weakly prime, because it can be changed into another prime (132300247) 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, 66150113 + 66150114.
It is an arithmetic number, because the mean of its divisors is an integer number (66150114).
Almost surely, 2132300227 is an apocalyptic number.
132300227 is a deficient number, since it is larger than the sum of its proper divisors (1).
132300227 is an equidigital number, since it uses as much as digits as its factorization.
132300227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 20.
The square root of 132300227 is about 11502.1835753043. The cubic root of 132300227 is about 509.5500671004.
Adding to 132300227 its reverse (722003231), we get a palindrome (854303458).
The spelling of 132300227 in words is "one hundred thirty-two million, three hundred thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •