Base | Representation |
---|---|
bin | 1110001010000000001001… |
… | …10001011001110110011101 |
3 | 11002012222222102201220220202 |
4 | 13011000010301121312131 |
5 | 13040013221233134323 |
6 | 150112532001353245 |
7 | 6362032331524625 |
oct | 705000461316635 |
9 | 132188872656822 |
10 | 31130003021213 |
11 | 9a12184169a48 |
12 | 35a9253038825 |
13 | 144a7150c97c5 |
14 | 7989b3447885 |
15 | 38eb6979dd28 |
hex | 1c5004c59d9d |
31130003021213 has 4 divisors (see below), whose sum is σ = 31162875253440. Its totient is φ = 31097130788988.
The previous prime is 31130003021041. The next prime is 31130003021261. The reversal of 31130003021213 is 31212030003113.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 31130003021213 - 220 = 31130001972637 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 (31130003020213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16436114693 + ... + 16436116586.
It is an arithmetic number, because the mean of its divisors is an integer number (7790718813360).
Almost surely, 231130003021213 is an apocalyptic number.
It is an amenable number.
31130003021213 is a deficient number, since it is larger than the sum of its proper divisors (32872232227).
31130003021213 is an equidigital number, since it uses as much as digits as its factorization.
31130003021213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32872232226.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 31130003021213 its reverse (31212030003113), we get a palindrome (62342033024326).
The spelling of 31130003021213 in words is "thirty-one trillion, one hundred thirty billion, three million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •