Base | Representation |
---|---|
bin | 11100111001101010… |
… | …001001011111100001 |
3 | 2222002200102002122102 |
4 | 130321222021133201 |
5 | 1002023210340223 |
6 | 22131142020145 |
7 | 2146001451614 |
oct | 347152113741 |
9 | 88080362572 |
10 | 31032121313 |
11 | 12184907056 |
12 | 6020717655 |
13 | 2c0716a97b |
14 | 170555817b |
15 | c19552928 |
hex | 739a897e1 |
31032121313 has 2 divisors, whose sum is σ = 31032121314. Its totient is φ = 31032121312.
The previous prime is 31032121291. The next prime is 31032121327. The reversal of 31032121313 is 31312123013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17684478289 + 13347643024 = 132983^2 + 115532^2 .
It is a cyclic number.
It is not a de Polignac number, because 31032121313 - 210 = 31032120289 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (31032121333) 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, 15516060656 + 15516060657.
It is an arithmetic number, because the mean of its divisors is an integer number (15516060657).
Almost surely, 231032121313 is an apocalyptic number.
It is an amenable number.
31032121313 is a deficient number, since it is larger than the sum of its proper divisors (1).
31032121313 is an equidigital number, since it uses as much as digits as its factorization.
31032121313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 31032121313 its reverse (31312123013), we get a palindrome (62344244326).
The spelling of 31032121313 in words is "thirty-one billion, thirty-two million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •