Base | Representation |
---|---|
bin | 10000001010010010000… |
… | …111110111111011100000 |
3 | 10221011112100120210102022 |
4 | 100022102013313323200 |
5 | 121143403043200000 |
6 | 2210103035041012 |
7 | 143143353411641 |
oct | 20122207677340 |
9 | 3834470523368 |
10 | 1110553100000 |
11 | 398a8a300243 |
12 | 15b295ba0168 |
13 | 8095624cc46 |
14 | 3ba72c856c8 |
15 | 1dd4c1b5585 |
hex | 102921f7ee0 |
1110553100000 has 72 divisors (see below), whose sum is σ = 2732827103496. Its totient is φ = 444221200000.
The previous prime is 1110553099961. The next prime is 1110553100023. The reversal of 1110553100000 is 13550111.
It is a super-2 number, since 2×11105531000002 (a number of 25 digits) 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 (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5452766 + ... + 5652765.
It is an arithmetic number, because the mean of its divisors is an integer number (37955931993).
Almost surely, 21110553100000 is an apocalyptic number.
1110553100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1110553100000 is an abundant number, since it is smaller than the sum of its proper divisors (1622274003496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1110553100000 is an frugal number, since it uses more digits than its factorization.
1110553100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11105566 (or 11105538 counting only the distinct ones).
The product of its (nonzero) digits is 75, while the sum is 17.
Adding to 1110553100000 its reverse (13550111), we get a palindrome (1110566650111).
The spelling of 1110553100000 in words is "one trillion, one hundred ten billion, five hundred fifty-three million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •