Base | Representation |
---|---|
bin | 1010000110110011110011… |
… | …1001100111001010000111 |
3 | 1110100022021111120221100200 |
4 | 2201230330321213022013 |
5 | 2424030041121132221 |
6 | 35344455041141543 |
7 | 2224552151442510 |
oct | 241547471471207 |
9 | 43308244527320 |
10 | 11112102130311 |
11 | 35a4685a626a6 |
12 | 12b572462a8b3 |
13 | 627b362a6640 |
14 | 2a5b859dba07 |
15 | 1440b80da426 |
hex | a1b3ce67287 |
11112102130311 has 96 divisors (see below), whose sum is σ = 20291477606400. Its totient is φ = 5702151313152.
The previous prime is 11112102130301. The next prime is 11112102130333. The reversal of 11112102130311 is 11303120121111.
11112102130311 is a `hidden beast` number, since 1 + 1 + 11 + 210 + 2 + 130 + 311 = 666.
It is not a de Polignac number, because 11112102130311 - 26 = 11112102130247 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11112102130301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 278737366 + ... + 278777228.
It is an arithmetic number, because the mean of its divisors is an integer number (211369558400).
Almost surely, 211112102130311 is an apocalyptic number.
11112102130311 is a deficient number, since it is larger than the sum of its proper divisors (9179375476089).
11112102130311 is a wasteful number, since it uses less digits than its factorization.
11112102130311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49125 (or 49122 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 11112102130311 its reverse (11303120121111), we get a palindrome (22415222251422).
The spelling of 11112102130311 in words is "eleven trillion, one hundred twelve billion, one hundred two million, one hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •