Base | Representation |
---|---|
bin | 1010000110000110101110… |
… | …0111011101101001001000 |
3 | 1110022011001011011211022110 |
4 | 2201201223213131221020 |
5 | 2423330300224000013 |
6 | 35335134200022320 |
7 | 2223643241515314 |
oct | 241415347355110 |
9 | 43264034154273 |
10 | 11100001000008 |
11 | 359a536208368 |
12 | 12b3307a619a0 |
13 | 6269581c39cb |
14 | 2a53587b6b44 |
15 | 143b0aa402c3 |
hex | a186b9dda48 |
11100001000008 has 16 divisors (see below), whose sum is σ = 27750002500080. Its totient is φ = 3700000333328.
The previous prime is 11100001000001. The next prime is 11100001000019. The reversal of 11100001000008 is 80000010000111.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 11100000999957 and 11100001000002.
It is not an unprimeable number, because it can be changed into a prime (11100001000001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 231250020810 + ... + 231250020857.
It is an arithmetic number, because the mean of its divisors is an integer number (1734375156255).
Almost surely, 211100001000008 is an apocalyptic number.
It is an amenable number.
11100001000008 is an abundant number, since it is smaller than the sum of its proper divisors (16650001500072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100001000008 is a wasteful number, since it uses less digits than its factorization.
11100001000008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462500041676 (or 462500041672 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11100001000008 its reverse (80000010000111), we get a palindrome (91100011000119).
The spelling of 11100001000008 in words is "eleven trillion, one hundred billion, one million, eight", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •