Base | Representation |
---|---|
bin | 11100110111111011… |
… | …110111000110101001 |
3 | 2222000200000020222201 |
4 | 130313323313012221 |
5 | 1001443310211103 |
6 | 22124230220201 |
7 | 2145200636536 |
oct | 346773670651 |
9 | 88020006881 |
10 | 31003210153 |
11 | 1216a55a733 |
12 | 6012ab4661 |
13 | 2c01187486 |
14 | 170178dd8d |
15 | c16c4151d |
hex | 737ef71a9 |
31003210153 has 2 divisors, whose sum is σ = 31003210154. Its totient is φ = 31003210152.
The previous prime is 31003210129. The next prime is 31003210159. The reversal of 31003210153 is 35101230013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23850786969 + 7152423184 = 154437^2 + 84572^2 .
It is a cyclic number.
It is not a de Polignac number, because 31003210153 - 29 = 31003209641 is a prime.
It is a super-2 number, since 2×310032101532 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 31003210153.
It is not a weakly prime, because it can be changed into another prime (31003210159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15501605076 + 15501605077.
It is an arithmetic number, because the mean of its divisors is an integer number (15501605077).
Almost surely, 231003210153 is an apocalyptic number.
It is an amenable number.
31003210153 is a deficient number, since it is larger than the sum of its proper divisors (1).
31003210153 is an equidigital number, since it uses as much as digits as its factorization.
31003210153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 19.
Adding to 31003210153 its reverse (35101230013), we get a palindrome (66104440166).
The spelling of 31003210153 in words is "thirty-one billion, three million, two hundred ten thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •