Base | Representation |
---|---|
bin | 100011010111101000011100… |
… | …0101011111111111010001001 |
3 | 1111210112221101120222210222102 |
4 | 1012233100320223333322021 |
5 | 311234221220220023423 |
6 | 3021402302503003145 |
7 | 122350020420214115 |
oct | 10657207053777211 |
9 | 1453487346883872 |
10 | 311111202111113 |
11 | 90147579a373a8 |
12 | 2aa875281394b5 |
13 | 104798780a9101 |
14 | 56b7c10ab0745 |
15 | 25e7ab2916c28 |
hex | 11af438affe89 |
311111202111113 has 8 divisors (see below), whose sum is σ = 325172599484928. Its totient is φ = 297094373351424.
The previous prime is 311111202111103. The next prime is 311111202111133.
311111202111113 is nontrivially palindromic in base 10.
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 311111202111113 - 26 = 311111202111049 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (311111202111103) 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, 11142139256 + ... + 11142167177.
It is an arithmetic number, because the mean of its divisors is an integer number (40646574935616).
Almost surely, 2311111202111113 is an apocalyptic number.
It is an amenable number.
311111202111113 is a deficient number, since it is larger than the sum of its proper divisors (14061397373815).
311111202111113 is a wasteful number, since it uses less digits than its factorization.
311111202111113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22284307063.
The product of its (nonzero) digits is 36, while the sum is 20.
It can be divided in two parts, 31111120 and 2111113, that added together give a palindrome (33222233).
The spelling of 311111202111113 in words is "three hundred eleven trillion, one hundred eleven billion, two hundred two million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •