Base | Representation |
---|---|
bin | 10000000000100100010… |
… | …100100111001100111000 |
3 | 10220011121022202202121122 |
4 | 100000210110213030320 |
5 | 121011021434323000 |
6 | 2201215535124412 |
7 | 142324011206204 |
oct | 20004424471470 |
9 | 3804538682548 |
10 | 1100121011000 |
11 | 3946166a3390 |
12 | 159264373708 |
13 | 7c982b9740b |
14 | 3b3635a7b04 |
15 | 1d93b406085 |
hex | 10024527338 |
1100121011000 has 128 divisors (see below), whose sum is σ = 2808888788160. Its totient is φ = 399961408000.
The previous prime is 1100121010997. The next prime is 1100121011027. The reversal of 1100121011000 is 1101210011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 85320554 + ... + 85333446.
Almost surely, 21100121011000 is an apocalyptic number.
1100121011000 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 1100121011000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1404444394080).
1100121011000 is an abundant number, since it is smaller than the sum of its proper divisors (1708767777160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100121011000 is a wasteful number, since it uses less digits than its factorization.
1100121011000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20682 (or 20668 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1100121011000 its reverse (1101210011), we get a palindrome (1101222221011).
The spelling of 1100121011000 in words is "one trillion, one hundred billion, one hundred twenty-one million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •