| Base | Representation |
|---|---|
| bin | 11101011011001001111… |
| … | …01010100010100111000 |
| 3 | 10120122121002202210001100 |
| 4 | 32231210331110110320 |
| 5 | 113031022321011300 |
| 6 | 2052241352451400 |
| 7 | 133020540434100 |
| oct | 16554475242470 |
| 9 | 3518532683040 |
| 10 | 1011011110200 |
| 11 | 35a849461a73 |
| 12 | 143b356a9b60 |
| 13 | 744515b3170 |
| 14 | 36d0c9aa200 |
| 15 | 1b47329c700 |
| hex | eb64f54538 |
1011011110200 has 864 divisors, whose sum is σ = 4368610078560. Its totient is φ = 207538329600.
The previous prime is 1011011110183. The next prime is 1011011110201. The reversal of 1011011110200 is 20111101101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011011110201) by changing a digit.
It is a polite number, since it can be written in 215 ways as a sum of consecutive naturals, for example, 42412285 + ... + 42436115.
It is an arithmetic number, because the mean of its divisors is an integer number (5056261665).
Almost surely, 21011011110200 is an apocalyptic number.
1011011110200 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 1011011110200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2184305039280).
1011011110200 is an abundant number, since it is smaller than the sum of its proper divisors (3357598968360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011011110200 is a wasteful number, since it uses less digits than its factorization.
1011011110200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23917 (or 23898 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1011011110200 its reverse (20111101101), we get a palindrome (1031122211301).
Subtracting from 1011011110200 its reverse (20111101101), we obtain a palindrome (990900009099).
It can be divided in two parts, 1011011 and 110200, that added together give a palindrome (1121211).
The spelling of 1011011110200 in words is "one trillion, eleven billion, eleven million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •