Base | Representation |
---|---|
bin | 11100111101101101… |
… | …100000010100110101 |
3 | 2222021102100021202212 |
4 | 130331231200110311 |
5 | 1002143112011013 |
6 | 22142011143205 |
7 | 2150455401011 |
oct | 347555402465 |
9 | 88242307685 |
10 | 31100110133 |
11 | 1220a224064 |
12 | 603b444b05 |
13 | 2c18283c41 |
14 | 17105b5541 |
15 | c204d26a8 |
hex | 73db60535 |
31100110133 has 2 divisors, whose sum is σ = 31100110134. Its totient is φ = 31100110132.
The previous prime is 31100110121. The next prime is 31100110147. The reversal of 31100110133 is 33101100113.
It is a happy number.
It is an a-pointer prime, because the next prime (31100110147) can be obtained adding 31100110133 to its sum of digits (14).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27801560644 + 3298549489 = 166738^2 + 57433^2 .
It is a cyclic number.
It is not a de Polignac number, because 31100110133 - 216 = 31100044597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31100110163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15550055066 + 15550055067.
It is an arithmetic number, because the mean of its divisors is an integer number (15550055067).
Almost surely, 231100110133 is an apocalyptic number.
It is an amenable number.
31100110133 is a deficient number, since it is larger than the sum of its proper divisors (1).
31100110133 is an equidigital number, since it uses as much as digits as its factorization.
31100110133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 31100110133 its reverse (33101100113), we get a palindrome (64201210246).
The spelling of 31100110133 in words is "thirty-one billion, one hundred million, one hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •