Base | Representation |
---|---|
bin | 1110001111100010010000… |
… | …01101100010011101000101 |
3 | 11002220011200112021001022122 |
4 | 13013301020031202131011 |
5 | 13101122042413442411 |
6 | 150340132234535325 |
7 | 6411542412122105 |
oct | 707611015423505 |
9 | 132804615231278 |
10 | 31320113030981 |
11 | 9a858703240a5 |
12 | 361a06a597545 |
13 | 1462621468148 |
14 | 7a3c89c41205 |
15 | 394a948459db |
hex | 1c7c48362745 |
31320113030981 has 2 divisors, whose sum is σ = 31320113030982. Its totient is φ = 31320113030980.
The previous prime is 31320113030977. The next prime is 31320113031001. The reversal of 31320113030981 is 18903031102313.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19948103668900 + 11372009362081 = 4466330^2 + 3372241^2 .
It is an emirp because it is prime and its reverse (18903031102313) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31320113030981 - 22 = 31320113030977 is a prime.
It is a super-2 number, since 2×313201130309812 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31320113030911) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15660056515490 + 15660056515491.
It is an arithmetic number, because the mean of its divisors is an integer number (15660056515491).
Almost surely, 231320113030981 is an apocalyptic number.
It is an amenable number.
31320113030981 is a deficient number, since it is larger than the sum of its proper divisors (1).
31320113030981 is an equidigital number, since it uses as much as digits as its factorization.
31320113030981 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 35.
The spelling of 31320113030981 in words is "thirty-one trillion, three hundred twenty billion, one hundred thirteen million, thirty thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •