Base | Representation |
---|---|
bin | 10000001010110011010… |
… | …101011101110110001111 |
3 | 10221012222012002001122021 |
4 | 100022303111131312033 |
5 | 121201023214430221 |
6 | 2210234222031011 |
7 | 143163230546500 |
oct | 20126325356617 |
9 | 3835865061567 |
10 | 1111110311311 |
11 | 399245893360 |
12 | 15b410718467 |
13 | 80a14816890 |
14 | 3bac6c90ba7 |
15 | 1dd81080041 |
hex | 102b355dd8f |
1111110311311 has 96 divisors (see below), whose sum is σ = 1601183808000. Its totient is φ = 755818801920.
The previous prime is 1111110311261. The next prime is 1111110311327. The reversal of 1111110311311 is 1131130111111.
It is a happy number.
It is not a de Polignac number, because 1111110311311 - 221 = 1111108214159 is a prime.
It is a super-2 number, since 2×11111103113112 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111110311711) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 79739701 + ... + 79753633.
It is an arithmetic number, because the mean of its divisors is an integer number (16678998000).
Almost surely, 21111110311311 is an apocalyptic number.
1111110311311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1111110311311 is a deficient number, since it is larger than the sum of its proper divisors (490073496689).
1111110311311 is a wasteful number, since it uses less digits than its factorization.
1111110311311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14589 (or 14582 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 16.
Adding to 1111110311311 its reverse (1131130111111), we get a palindrome (2242240422422).
The spelling of 1111110311311 in words is "one trillion, one hundred eleven billion, one hundred ten million, three hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •