Base | Representation |
---|---|
bin | 11101000100010001… |
… | …000111110010110101 |
3 | 2222120002022212101221 |
4 | 131010101013302311 |
5 | 1002404242011013 |
6 | 22200540550341 |
7 | 2153262362506 |
oct | 350421076265 |
9 | 88502285357 |
10 | 31210110133 |
11 | 12266325754 |
12 | 60702523b1 |
13 | 2c34cb92b7 |
14 | 172104abad |
15 | c29eb008d |
hex | 744447cb5 |
31210110133 has 2 divisors, whose sum is σ = 31210110134. Its totient is φ = 31210110132.
The previous prime is 31210110101. The next prime is 31210110149. The reversal of 31210110133 is 33101101213.
It is an a-pointer prime, because the next prime (31210110149) can be obtained adding 31210110133 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24630791364 + 6579318769 = 156942^2 + 81113^2 .
It is a cyclic number.
It is not a de Polignac number, because 31210110133 - 25 = 31210110101 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31210110193) 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, 15605055066 + 15605055067.
It is an arithmetic number, because the mean of its divisors is an integer number (15605055067).
Almost surely, 231210110133 is an apocalyptic number.
It is an amenable number.
31210110133 is a deficient number, since it is larger than the sum of its proper divisors (1).
31210110133 is an equidigital number, since it uses as much as digits as its factorization.
31210110133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 31210110133 its reverse (33101101213), we get a palindrome (64311211346).
The spelling of 31210110133 in words is "thirty-one billion, two hundred ten million, one hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •