Base | Representation |
---|---|
bin | 10000001001110111101… |
… | …101100101010110100110 |
3 | 10221010101110211000020120 |
4 | 100021313231211112212 |
5 | 121142001130004200 |
6 | 2205551045542410 |
7 | 143126363212545 |
oct | 20116755452646 |
9 | 3833343730216 |
10 | 1110110000550 |
11 | 398882178051 |
12 | 15b191714a06 |
13 | 808b54cb115 |
14 | 3ba300a215c |
15 | 1dd2333b9a0 |
hex | 10277b655a6 |
1110110000550 has 24 divisors (see below), whose sum is σ = 2753072801736. Its totient is φ = 296029333440.
The previous prime is 1110110000543. The next prime is 1110110000579. The reversal of 1110110000550 is 550000110111.
It is a super-2 number, since 2×11101100005502 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3700366519 + ... + 3700366818.
It is an arithmetic number, because the mean of its divisors is an integer number (114711366739).
Almost surely, 21110110000550 is an apocalyptic number.
1110110000550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1110110000550 is an abundant number, since it is smaller than the sum of its proper divisors (1642962801186).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110110000550 is a wasteful number, since it uses less digits than its factorization.
1110110000550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7400733352 (or 7400733347 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 15.
Adding to 1110110000550 its reverse (550000110111), we get a palindrome (1660110110661).
The spelling of 1110110000550 in words is "one trillion, one hundred ten billion, one hundred ten million, five hundred fifty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •