Base | Representation |
---|---|
bin | 11110000011110010110011… |
… | …111000100100101110010111 |
3 | 122100002101202102222010221121 |
4 | 132003302303320210232113 |
5 | 114311444410444314111 |
6 | 1145100451142024411 |
7 | 36563200363130341 |
oct | 3603626370445627 |
9 | 570071672863847 |
10 | 132202111323031 |
11 | 3913a667381482 |
12 | 129b17a3718107 |
13 | 589c7b468c399 |
14 | 249088b2c6291 |
15 | 1043d3104c871 |
hex | 783cb3e24b97 |
132202111323031 has 2 divisors, whose sum is σ = 132202111323032. Its totient is φ = 132202111323030.
The previous prime is 132202111323001. The next prime is 132202111323077. The reversal of 132202111323031 is 130323111202231.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 132202111323031 - 225 = 132202077768599 is a prime.
It is a super-2 number, since 2×1322021113230312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132202111322987 and 132202111323005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132202111323001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66101055661515 + 66101055661516.
It is an arithmetic number, because the mean of its divisors is an integer number (66101055661516).
Almost surely, 2132202111323031 is an apocalyptic number.
132202111323031 is a deficient number, since it is larger than the sum of its proper divisors (1).
132202111323031 is an equidigital number, since it uses as much as digits as its factorization.
132202111323031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 132202111323031 its reverse (130323111202231), we get a palindrome (262525222525262).
The spelling of 132202111323031 in words is "one hundred thirty-two trillion, two hundred two billion, one hundred eleven million, three hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •