Base | Representation |
---|---|
bin | 1110001001101101100001… |
… | …01011110000111100100101 |
3 | 11002012001011110122202221111 |
4 | 13010312300223300330211 |
5 | 13034332231043302323 |
6 | 150104155351545021 |
7 | 6361226445142030 |
oct | 704666053607445 |
9 | 132161143582844 |
10 | 31120002322213 |
11 | 9a08a12017852 |
12 | 35a732198b171 |
13 | 14497b022612c |
14 | 798305182017 |
15 | 38e781803c0d |
hex | 1c4db0af0f25 |
31120002322213 has 8 divisors (see below), whose sum is σ = 35566451958528. Its totient is φ = 26673736440624.
The previous prime is 31120002322169. The next prime is 31120002322219. The reversal of 31120002322213 is 31222320002113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31120002322213 - 29 = 31120002321701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31120002322219) 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 in 7 ways as a sum of consecutive naturals, for example, 45575581 + ... + 46253362.
It is an arithmetic number, because the mean of its divisors is an integer number (4445806494816).
Almost surely, 231120002322213 is an apocalyptic number.
It is an amenable number.
31120002322213 is a deficient number, since it is larger than the sum of its proper divisors (4446449636315).
31120002322213 is an equidigital number, since it uses as much as digits as its factorization.
31120002322213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91877363.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 31120002322213 its reverse (31222320002113), we get a palindrome (62342322324326).
The spelling of 31120002322213 in words is "thirty-one trillion, one hundred twenty billion, two million, three hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •