Base | Representation |
---|---|
bin | 100011010111101000011001… |
… | …1110111000000100001001001 |
3 | 1111210112221011221120120212102 |
4 | 1012233100303313000201021 |
5 | 311234221034001023423 |
6 | 3021402250450523145 |
7 | 122350015414554401 |
oct | 10657206367004111 |
9 | 1453487157516772 |
10 | 311111121111113 |
11 | 90147538242954 |
12 | 2aa87504b964b5 |
13 | 1047986438880b |
14 | 56b7c04027801 |
15 | 25e7aaa766c28 |
hex | 11af433dc0849 |
311111121111113 has 4 divisors (see below), whose sum is σ = 314191429241028. Its totient is φ = 308030812981200.
The previous prime is 311111121111083. The next prime is 311111121111199.
311111121111113 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 289273696770304 + 21837424340809 = 17008048^2 + 4673053^2 .
It is a cyclic number.
It is not a de Polignac number, because 311111121111113 - 220 = 311111120062537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311111121111313) 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, 1540154064806 + ... + 1540154065007.
It is an arithmetic number, because the mean of its divisors is an integer number (78547857310257).
Almost surely, 2311111121111113 is an apocalyptic number.
It is an amenable number.
311111121111113 is a deficient number, since it is larger than the sum of its proper divisors (3080308129915).
311111121111113 is a wasteful number, since it uses less digits than its factorization.
311111121111113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3080308129914.
The product of its digits is 18, while the sum is 20.
The spelling of 311111121111113 in words is "three hundred eleven trillion, one hundred eleven billion, one hundred twenty-one million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •