Base | Representation |
---|---|
bin | 1110001001001000010001… |
… | …01000011111000110011101 |
3 | 11002010010112200110000112122 |
4 | 13010210020220133012131 |
5 | 13034020301233134323 |
6 | 150051051045312325 |
7 | 6356621031656030 |
oct | 704441050370635 |
9 | 132103480400478 |
10 | 31100003021213 |
11 | 9a00489a25a15 |
12 | 35a34801056a5 |
13 | 1447943a34709 |
14 | 797368ddd017 |
15 | 38deb0b74ec8 |
hex | 1c4908a1f19d |
31100003021213 has 8 divisors (see below), whose sum is σ = 35556959330880. Its totient is φ = 26646571395360.
The previous prime is 31100003021209. The next prime is 31100003021221. The reversal of 31100003021213 is 31212030000113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31100003021213 - 22 = 31100003021209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 31100003021191 and 31100003021200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31100003021233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 881152043 + ... + 881187336.
It is an arithmetic number, because the mean of its divisors is an integer number (4444619916360).
Almost surely, 231100003021213 is an apocalyptic number.
It is an amenable number.
31100003021213 is a deficient number, since it is larger than the sum of its proper divisors (4456956309667).
31100003021213 is a wasteful number, since it uses less digits than its factorization.
31100003021213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1762341907.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 31100003021213 its reverse (31212030000113), we get a palindrome (62312033021326).
The spelling of 31100003021213 in words is "thirty-one trillion, one hundred billion, three million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •