Base | Representation |
---|---|
bin | 111101100100001010… |
… | …1001010110001100001 |
3 | 110122020221110110002201 |
4 | 1323020111022301201 |
5 | 4131231230324413 |
6 | 140423023213201 |
7 | 12360200360536 |
oct | 1731025126141 |
9 | 418227413081 |
10 | 132210011233 |
11 | 510851172a3 |
12 | 21758a47201 |
13 | c60c9ccba1 |
14 | 6582bd0d8d |
15 | 368bdab9dd |
hex | 1ec854ac61 |
132210011233 has 2 divisors, whose sum is σ = 132210011234. Its totient is φ = 132210011232.
The previous prime is 132210011207. The next prime is 132210011243. The reversal of 132210011233 is 332110012231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130807358929 + 1402652304 = 361673^2 + 37452^2 .
It is a cyclic number.
It is not a de Polignac number, because 132210011233 - 217 = 132209880161 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132210011233.
It is not a weakly prime, because it can be changed into another prime (132210011243) 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, 66105005616 + 66105005617.
It is an arithmetic number, because the mean of its divisors is an integer number (66105005617).
Almost surely, 2132210011233 is an apocalyptic number.
It is an amenable number.
132210011233 is a deficient number, since it is larger than the sum of its proper divisors (1).
132210011233 is an equidigital number, since it uses as much as digits as its factorization.
132210011233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 132210011233 its reverse (332110012231), we get a palindrome (464320023464).
The spelling of 132210011233 in words is "one hundred thirty-two billion, two hundred ten million, eleven thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •