Base | Representation |
---|---|
bin | 100001000101010… |
… | …1110111111111000 |
3 | 2212100212102220121 |
4 | 1002022232333320 |
5 | 4233142011300 |
6 | 302053303024 |
7 | 36336531613 |
oct | 10212567770 |
9 | 2770772817 |
10 | 1110110200 |
11 | 51a6a0251 |
12 | 26b934a74 |
13 | 148cb0754 |
14 | a761117a |
15 | 676d181a |
hex | 422aeff8 |
1110110200 has 48 divisors (see below), whose sum is σ = 2732838480. Its totient is φ = 417922560.
The previous prime is 1110110191. The next prime is 1110110257. The reversal of 1110110200 is 20110111.
It is a super-2 number, since 2×11101102002 = 2464689312288080000, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 159852 + ... + 166651.
It is an arithmetic number, because the mean of its divisors is an integer number (56934135).
Almost surely, 21110110200 is an apocalyptic number.
1110110200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1110110200 is an abundant number, since it is smaller than the sum of its proper divisors (1622728280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110110200 is a wasteful number, since it uses less digits than its factorization.
1110110200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326536 (or 326527 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
The square root of 1110110200 is about 33318.3162839901. The cubic root of 1110110200 is about 1035.4330688636.
Adding to 1110110200 its reverse (20110111), we get a palindrome (1130220311).
The spelling of 1110110200 in words is "one billion, one hundred ten million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •