Base | Representation |
---|---|
bin | 111101100001001101… |
… | …1110111000100001001 |
3 | 110122000001100100102211 |
4 | 1323002123313010021 |
5 | 4131030420232332 |
6 | 140405131225121 |
7 | 12354556561213 |
oct | 1730233670411 |
9 | 418001310384 |
10 | 132111102217 |
11 | 51034300506 |
12 | 2172b8a81a1 |
13 | c5c537bb43 |
14 | 6573a055b3 |
15 | 3683370447 |
hex | 1ec26f7109 |
132111102217 has 2 divisors, whose sum is σ = 132111102218. Its totient is φ = 132111102216.
The previous prime is 132111102209. The next prime is 132111102239. The reversal of 132111102217 is 712201111231.
It is an a-pointer prime, because the next prime (132111102239) can be obtained adding 132111102217 to its sum of digits (22).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132045751161 + 65351056 = 363381^2 + 8084^2 .
It is a cyclic number.
It is not a de Polignac number, because 132111102217 - 23 = 132111102209 is a prime.
It is not a weakly prime, because it can be changed into another prime (132111103217) 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, 66055551108 + 66055551109.
It is an arithmetic number, because the mean of its divisors is an integer number (66055551109).
Almost surely, 2132111102217 is an apocalyptic number.
It is an amenable number.
132111102217 is a deficient number, since it is larger than the sum of its proper divisors (1).
132111102217 is an equidigital number, since it uses as much as digits as its factorization.
132111102217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 22.
Adding to 132111102217 its reverse (712201111231), we get a palindrome (844312213448).
The spelling of 132111102217 in words is "one hundred thirty-two billion, one hundred eleven million, one hundred two thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •