Base | Representation |
---|---|
bin | 11101001100100110… |
… | …111101010100100101 |
3 | 2222220211122122201222 |
4 | 131030212331110211 |
5 | 1003201103132013 |
6 | 22222500230125 |
7 | 2156612021621 |
oct | 351446752445 |
9 | 88824578658 |
10 | 31350052133 |
11 | 123283181a4 |
12 | 60ab09b345 |
13 | 2c57ca610a |
14 | 1735878181 |
15 | c37404508 |
hex | 74c9bd525 |
31350052133 has 2 divisors, whose sum is σ = 31350052134. Its totient is φ = 31350052132.
The previous prime is 31350052073. The next prime is 31350052147. The reversal of 31350052133 is 33125005313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16461659809 + 14888392324 = 128303^2 + 122018^2 .
It is a cyclic number.
It is not a de Polignac number, because 31350052133 - 214 = 31350035749 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31350052163) 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, 15675026066 + 15675026067.
It is an arithmetic number, because the mean of its divisors is an integer number (15675026067).
Almost surely, 231350052133 is an apocalyptic number.
It is an amenable number.
31350052133 is a deficient number, since it is larger than the sum of its proper divisors (1).
31350052133 is an equidigital number, since it uses as much as digits as its factorization.
31350052133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4050, while the sum is 26.
Adding to 31350052133 its reverse (33125005313), we get a palindrome (64475057446).
The spelling of 31350052133 in words is "thirty-one billion, three hundred fifty million, fifty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.033 sec. • engine limits •