Base | Representation |
---|---|
bin | 1111110001010… |
… | …11110111010111 |
3 | 100012221112211011 |
4 | 13320223313113 |
5 | 232332101442 |
6 | 21043353051 |
7 | 3164351002 |
oct | 770536727 |
9 | 305845734 |
10 | 132300247 |
11 | 68753152 |
12 | 38382787 |
13 | 21542791 |
14 | 137dc539 |
15 | b935117 |
hex | 7e2bdd7 |
132300247 has 2 divisors, whose sum is σ = 132300248. Its totient is φ = 132300246.
The previous prime is 132300227. The next prime is 132300299. The reversal of 132300247 is 742003231.
It is a weak prime.
It is an emirp because it is prime and its reverse (742003231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132300247 - 223 = 123911639 is a prime.
It is a super-2 number, since 2×1323002472 = 35006710712522018, which contains 22 as substring.
It is equal to p7501252 and since 132300247 and 7501252 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132300227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66150123 + 66150124.
It is an arithmetic number, because the mean of its divisors is an integer number (66150124).
Almost surely, 2132300247 is an apocalyptic number.
132300247 is a deficient number, since it is larger than the sum of its proper divisors (1).
132300247 is an equidigital number, since it uses as much as digits as its factorization.
132300247 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 22.
The square root of 132300247 is about 11502.1844447044. The cubic root of 132300247 is about 509.5500927769.
Adding to 132300247 its reverse (742003231), we get a palindrome (874303478).
The spelling of 132300247 in words is "one hundred thirty-two million, three hundred thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •