Base | Representation |
---|---|
bin | 1111110000110… |
… | …00101000000111 |
3 | 100012210112201122 |
4 | 13320120220013 |
5 | 232322041242 |
6 | 21041544155 |
7 | 3163602161 |
oct | 770305007 |
9 | 305715648 |
10 | 132221447 |
11 | 686a9a26 |
12 | 3834505b |
13 | 21515957 |
14 | 137bb931 |
15 | b91bad2 |
hex | 7e18a07 |
132221447 has 2 divisors, whose sum is σ = 132221448. Its totient is φ = 132221446.
The previous prime is 132221429. The next prime is 132221449. The reversal of 132221447 is 744122231.
It is a strong prime.
It is an emirp because it is prime and its reverse (744122231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132221447 - 28 = 132221191 is a prime.
It is a super-2 number, since 2×1322214472 = 34965022093547618, which contains 22 as substring.
Together with 132221449, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132221449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66110723 + 66110724.
It is an arithmetic number, because the mean of its divisors is an integer number (66110724).
Almost surely, 2132221447 is an apocalyptic number.
132221447 is a deficient number, since it is larger than the sum of its proper divisors (1).
132221447 is an equidigital number, since it uses as much as digits as its factorization.
132221447 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2688, while the sum is 26.
The square root of 132221447 is about 11498.7584982032. The cubic root of 132221447 is about 509.4489074738.
Adding to 132221447 its reverse (744122231), we get a palindrome (876343678).
The spelling of 132221447 in words is "one hundred thirty-two million, two hundred twenty-one thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •