| Base | Representation |
|---|---|
| bin | 1010000110101100010110… |
| … | …0100000110000011101000 |
| 3 | 1110100010002222020020021020 |
| 4 | 2201223011210012003220 |
| 5 | 2424011441100013000 |
| 6 | 35343524240412440 |
| 7 | 2224451430562020 |
| oct | 241530544060350 |
| 9 | 43303088206236 |
| 10 | 11110100001000 |
| 11 | 35a38488a1280 |
| 12 | 12b5266017120 |
| 13 | 6278a7565040 |
| 14 | 2a5a35b4aa80 |
| 15 | 143eec456ba0 |
| hex | a1ac59060e8 |
11110100001000 has 1024 divisors, whose sum is σ = 47799567728640. Its totient is φ = 2073392640000.
The previous prime is 11110100000971. The next prime is 11110100001031. The reversal of 11110100001000 is 10000101111.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a self number, because there is not a number n which added to its sum of digits gives 11110100001000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 111061005 + ... + 111160995.
It is an arithmetic number, because the mean of its divisors is an integer number (46679265360).
Almost surely, 211110100001000 is an apocalyptic number.
11110100001000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11110100001000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23899783864320).
11110100001000 is an abundant number, since it is smaller than the sum of its proper divisors (36689467727640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110100001000 is a wasteful number, since it uses less digits than its factorization.
11110100001000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100083 (or 100069 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 11110100001000 its reverse (10000101111), we get a palindrome (11120100102111).
It can be divided in two parts, 11 and 110100001000, that added together give a palindrome (110100001011).
The spelling of 11110100001000 in words is "eleven trillion, one hundred ten billion, one hundred million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •