Base | Representation |
---|---|
bin | 1110001111100011111101… |
… | …11111001011010011011101 |
3 | 11002220021001120111011200111 |
4 | 13013301332333023103131 |
5 | 13101130433143404041 |
6 | 150340403343530021 |
7 | 6411604241260042 |
oct | 707617677132335 |
9 | 132807046434614 |
10 | 31321032013021 |
11 | 9a861a2040993 |
12 | 361a2862b9911 |
13 | 14627399797ba |
14 | 7a3d35cdd1c9 |
15 | 394aea371981 |
hex | 1c7c7efcb4dd |
31321032013021 has 2 divisors, whose sum is σ = 31321032013022. Its totient is φ = 31321032013020.
The previous prime is 31321032013003. The next prime is 31321032013171. The reversal of 31321032013021 is 12031023012313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31272812684100 + 48219328921 = 5592210^2 + 219589^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31321032013021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31321032012983 and 31321032013001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31321032053021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15660516006510 + 15660516006511.
It is an arithmetic number, because the mean of its divisors is an integer number (15660516006511).
Almost surely, 231321032013021 is an apocalyptic number.
It is an amenable number.
31321032013021 is a deficient number, since it is larger than the sum of its proper divisors (1).
31321032013021 is an equidigital number, since it uses as much as digits as its factorization.
31321032013021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 31321032013021 its reverse (12031023012313), we get a palindrome (43352055025334).
The spelling of 31321032013021 in words is "thirty-one trillion, three hundred twenty-one billion, thirty-two million, thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •