Base | Representation |
---|---|
bin | 10000001010110010101… |
… | …110100011010100011110 |
3 | 10221012221110212210020000 |
4 | 100022302232203110132 |
5 | 121201013112010420 |
6 | 2210233215235130 |
7 | 143163045051414 |
oct | 20126256432436 |
9 | 3835843783200 |
10 | 1111100110110 |
11 | 399240056011 |
12 | 15b409218aa6 |
13 | 80a12684573 |
14 | 3bac57972b4 |
15 | 1dd80217690 |
hex | 102b2ba351e |
1111100110110 has 80 divisors (see below), whose sum is σ = 2988185490576. Its totient is φ = 296237751552.
The previous prime is 1111100110091. The next prime is 1111100110121. The reversal of 1111100110110 is 110110011111.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1111100110092 and 1111100110101.
It is a congruent number.
It is an unprimeable number.
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 39 ways as a sum of consecutive naturals, for example, 4282822 + ... + 4534838.
Almost surely, 21111100110110 is an apocalyptic number.
1111100110110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1111100110110 is an abundant number, since it is smaller than the sum of its proper divisors (1877085380466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111100110110 is a wasteful number, since it uses less digits than its factorization.
1111100110110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257479 (or 257470 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 1111100110110 its reverse (110110011111), we get a palindrome (1221210121221).
The spelling of 1111100110110 in words is "one trillion, one hundred eleven billion, one hundred million, one hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •