Base | Representation |
---|---|
bin | 10000001010101101010… |
… | …110111000101100010000 |
3 | 10221012201012100201222102 |
4 | 100022231112320230100 |
5 | 121200322031120422 |
6 | 2210220240255532 |
7 | 143160602232356 |
oct | 20125526705420 |
9 | 3835635321872 |
10 | 1111010020112 |
11 | 3991a4213073 |
12 | 15b3a30115a8 |
13 | 809c9b00685 |
14 | 3bab78257d6 |
15 | 1dd7736e192 |
hex | 102ad5b8b10 |
1111010020112 has 80 divisors (see below), whose sum is σ = 2217281299200. Its totient is φ = 539123014656.
The previous prime is 1111010020111. The next prime is 1111010020139. The reversal of 1111010020112 is 2110200101111.
It is a junction number, because it is equal to n+sod(n) for n = 1111010020093 and 1111010020102.
It is not an unprimeable number, because it can be changed into a prime (1111010020111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18591593 + ... + 18651255.
It is an arithmetic number, because the mean of its divisors is an integer number (27716016240).
Almost surely, 21111010020112 is an apocalyptic number.
It is an amenable number.
1111010020112 is a deficient number, since it is larger than the sum of its proper divisors (1106271279088).
1111010020112 is a wasteful number, since it uses less digits than its factorization.
1111010020112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60000 (or 59994 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1111010020112 its reverse (2110200101111), we get a palindrome (3221210121223).
The spelling of 1111010020112 in words is "one trillion, one hundred eleven billion, ten million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •