Base | Representation |
---|---|
bin | 11110000011111010001010… |
… | …000101100000000010100001 |
3 | 122100010011010012220121210102 |
4 | 132003322022011200002201 |
5 | 114312112040000100413 |
6 | 1145104234023512145 |
7 | 36563600022611105 |
oct | 3603721205400241 |
9 | 570104105817712 |
10 | 132210000003233 |
11 | 39142a45326699 |
12 | 129b32255b8655 |
13 | 58a0470b274a9 |
14 | 2490dd8c93905 |
15 | 10441438a9458 |
hex | 783e8a1600a1 |
132210000003233 has 2 divisors, whose sum is σ = 132210000003234. Its totient is φ = 132210000003232.
The previous prime is 132210000003227. The next prime is 132210000003299. The reversal of 132210000003233 is 332300000012231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108702164117089 + 23507835886144 = 10426033^2 + 4848488^2 .
It is an emirp because it is prime and its reverse (332300000012231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 132210000003233 - 222 = 132209995808929 is a prime.
It is not a weakly prime, because it can be changed into another prime (132210000003203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66105000001616 + 66105000001617.
It is an arithmetic number, because the mean of its divisors is an integer number (66105000001617).
Almost surely, 2132210000003233 is an apocalyptic number.
It is an amenable number.
132210000003233 is a deficient number, since it is larger than the sum of its proper divisors (1).
132210000003233 is an equidigital number, since it uses as much as digits as its factorization.
132210000003233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 132210000003233 its reverse (332300000012231), we get a palindrome (464510000015464).
The spelling of 132210000003233 in words is "one hundred thirty-two trillion, two hundred ten billion, three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •