Base | Representation |
---|---|
bin | 10000001001111000010… |
… | …011110001010101100111 |
3 | 10221010102011122121011002 |
4 | 100021320103301111213 |
5 | 121142011210323421 |
6 | 2205552044303515 |
7 | 143126544255056 |
oct | 20117023612547 |
9 | 3833364577132 |
10 | 1110120011111 |
11 | 398887895141 |
12 | 15b194b41b9b |
13 | 808b75c4727 |
14 | 3ba3154a39d |
15 | 1dd24167b0b |
hex | 102784f1567 |
1110120011111 has 16 divisors (see below), whose sum is σ = 1137549329280. Its totient is φ = 1082944262400.
The previous prime is 1110120011093. The next prime is 1110120011123. The reversal of 1110120011111 is 1111100210111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1110120011111 - 214 = 1110119994727 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110120011092 and 1110120011101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110120011411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8592530 + ... + 8720768.
It is an arithmetic number, because the mean of its divisors is an integer number (71096833080).
Almost surely, 21110120011111 is an apocalyptic number.
1110120011111 is a deficient number, since it is larger than the sum of its proper divisors (27429318169).
1110120011111 is a wasteful number, since it uses less digits than its factorization.
1110120011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129226.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 1110120011111 its reverse (1111100210111), we get a palindrome (2221220221222).
The spelling of 1110120011111 in words is "one trillion, one hundred ten billion, one hundred twenty million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •