Base | Representation |
---|---|
bin | 11100111110011110… |
… | …101110000000001101 |
3 | 2222022022121201201122 |
4 | 130332132232000031 |
5 | 1002204412324323 |
6 | 22143151450325 |
7 | 2151003142334 |
oct | 347636560015 |
9 | 88268551648 |
10 | 31113011213 |
11 | 12216535909 |
12 | 60438269a5 |
13 | 2c1ab5010b |
14 | 17121b2d1b |
15 | c216ceec8 |
hex | 73e7ae00d |
31113011213 has 8 divisors (see below), whose sum is σ = 32146960896. Its totient is φ = 30080955600.
The previous prime is 31113011203. The next prime is 31113011239. The reversal of 31113011213 is 31211031113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 31113011213 - 24 = 31113011197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 31113011191 and 31113011200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31113011203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 440081 + ... + 505862.
It is an arithmetic number, because the mean of its divisors is an integer number (4018370112).
Almost surely, 231113011213 is an apocalyptic number.
It is an amenable number.
31113011213 is a deficient number, since it is larger than the sum of its proper divisors (1033949683).
31113011213 is a wasteful number, since it uses less digits than its factorization.
31113011213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 947035.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 31113011213 its reverse (31211031113), we get a palindrome (62324042326).
The spelling of 31113011213 in words is "thirty-one billion, one hundred thirteen million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •