Base | Representation |
---|---|
bin | 1110001111100100100000… |
… | …10101010010011111101001 |
3 | 11002220021210212001222101102 |
4 | 13013302100111102133221 |
5 | 13101132032143203223 |
6 | 150340452301131145 |
7 | 6411614403642452 |
oct | 707622025223751 |
9 | 132807725058342 |
10 | 31321323022313 |
11 | 9a86331334535 |
12 | 361a347859ab5 |
13 | 146278504a24c |
14 | 7a3d62812129 |
15 | 394b15ba6928 |
hex | 1c7c905527e9 |
31321323022313 has 2 divisors, whose sum is σ = 31321323022314. Its totient is φ = 31321323022312.
The previous prime is 31321323022309. The next prime is 31321323022333. The reversal of 31321323022313 is 31322032312313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22439093208064 + 8882229814249 = 4736992^2 + 2980307^2 .
It is a cyclic number.
It is not a de Polignac number, because 31321323022313 - 22 = 31321323022309 is a prime.
It is not a weakly prime, because it can be changed into another prime (31321323022303) 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, 15660661511156 + 15660661511157.
It is an arithmetic number, because the mean of its divisors is an integer number (15660661511157).
Almost surely, 231321323022313 is an apocalyptic number.
It is an amenable number.
31321323022313 is a deficient number, since it is larger than the sum of its proper divisors (1).
31321323022313 is an equidigital number, since it uses as much as digits as its factorization.
31321323022313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 31321323022313 its reverse (31322032312313), we get a palindrome (62643355334626).
The spelling of 31321323022313 in words is "thirty-one trillion, three hundred twenty-one billion, three hundred twenty-three million, twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •