Base | Representation |
---|---|
bin | 1010000000010101111010… |
… | …1100100111111000111000 |
3 | 1102221200111121022222220110 |
4 | 2200011132230213320320 |
5 | 2420220022000013310 |
6 | 35221442321024320 |
7 | 2213540015100345 |
oct | 240053654477070 |
9 | 42850447288813 |
10 | 11001000001080 |
11 | 3561552783591 |
12 | 12980987850a0 |
13 | 61a50b66187b |
14 | 2a06462c37cc |
15 | 14126438ad20 |
hex | a015eb27e38 |
11001000001080 has 64 divisors (see below), whose sum is σ = 33003286509600. Its totient is φ = 2933574533120.
The previous prime is 11001000001063. The next prime is 11001000001081. The reversal of 11001000001080 is 8010000010011.
It is a happy number.
It is a super-3 number, since 3×110010000010803 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001000001081) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16438456 + ... + 17094584.
Almost surely, 211001000001080 is an apocalyptic number.
11001000001080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11001000001080 is an abundant number, since it is smaller than the sum of its proper divisors (22002286508520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001000001080 is a wasteful number, since it uses less digits than its factorization.
11001000001080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 795864 (or 795860 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11001000001080 its reverse (8010000010011), we get a palindrome (19011000011091).
The spelling of 11001000001080 in words is "eleven trillion, one billion, one thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •