Base | Representation |
---|---|
bin | 10000000000111110001… |
… | …101101110101110001100 |
3 | 10220012201121011202001220 |
4 | 100000332031232232030 |
5 | 121012414141230122 |
6 | 2201331014003340 |
7 | 142340534446356 |
oct | 20007615565614 |
9 | 3805647152056 |
10 | 1100555414412 |
11 | 394819927073 |
12 | 159365946550 |
13 | 7ca21b9305c |
14 | 3b3a51660d6 |
15 | 1d96461325c |
hex | 1003e36eb8c |
1100555414412 has 24 divisors (see below), whose sum is σ = 2567989088112. Its totient is φ = 366848025600.
The previous prime is 1100555414411. The next prime is 1100555414417. The reversal of 1100555414412 is 2144145550011.
It is a super-2 number, since 2×11005554144122 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1100555414411) 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 7 ways as a sum of consecutive naturals, for example, 900612 + ... + 1735572.
It is an arithmetic number, because the mean of its divisors is an integer number (106999545338).
Almost surely, 21100555414412 is an apocalyptic number.
1100555414412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1100555414412 is an abundant number, since it is smaller than the sum of its proper divisors (1467433673700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100555414412 is a wasteful number, since it uses less digits than its factorization.
1100555414412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 944809 (or 944807 counting only the distinct ones).
The product of its (nonzero) digits is 16000, while the sum is 33.
The spelling of 1100555414412 in words is "one trillion, one hundred billion, five hundred fifty-five million, four hundred fourteen thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •