Base | Representation |
---|---|
bin | 10000001010110011011… |
… | …011111010011001010110 |
3 | 10221012222022020220121102 |
4 | 100022303123322121112 |
5 | 121201024133013420 |
6 | 2210234322150102 |
7 | 143163251115146 |
oct | 20126333723126 |
9 | 3835868226542 |
10 | 1111112001110 |
11 | 399246837991 |
12 | 15b4111b2332 |
13 | 80a14c88a67 |
14 | 3bac71b0926 |
15 | 1dd812b5a75 |
hex | 102b36fa656 |
1111112001110 has 32 divisors (see below), whose sum is σ = 2050336411200. Its totient is φ = 433275735040.
The previous prime is 1111112001091. The next prime is 1111112001119. The reversal of 1111112001110 is 111002111111.
It is a happy number.
It is a super-3 number, since 3×11111120011103 (a number of 37 digits) contains 333 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1111112001091 and 1111112001100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111112001119) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 486515 + ... + 1568094.
It is an arithmetic number, because the mean of its divisors is an integer number (64073012850).
Almost surely, 21111112001110 is an apocalyptic number.
1111112001110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1111112001110 is a deficient number, since it is larger than the sum of its proper divisors (939224410090).
1111112001110 is a wasteful number, since it uses less digits than its factorization.
1111112001110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2055976.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 1111112001110 its reverse (111002111111), we get a palindrome (1222114112221).
The spelling of 1111112001110 in words is "one trillion, one hundred eleven billion, one hundred twelve million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •