Base | Representation |
---|---|
bin | 10000001010111000110… |
… | …111100101001001101000 |
3 | 10221020012122202020221021 |
4 | 100022320313211021220 |
5 | 121201221000441300 |
6 | 2210251335422224 |
7 | 143165435563606 |
oct | 20127067451150 |
9 | 3836178666837 |
10 | 1111203140200 |
11 | 39929322704a |
12 | 15b437824974 |
13 | 80a2ab1930a |
14 | 3bad5336876 |
15 | 1dd892b9d1a |
hex | 102b8de5268 |
1111203140200 has 192 divisors, whose sum is σ = 2881566014400. Its totient is φ = 396032716800.
The previous prime is 1111203140147. The next prime is 1111203140213. The reversal of 1111203140200 is 20413021111.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 103160815 + ... + 103171585.
It is an arithmetic number, because the mean of its divisors is an integer number (15008156325).
Almost surely, 21111203140200 is an apocalyptic number.
1111203140200 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 1111203140200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1440783007200).
1111203140200 is an abundant number, since it is smaller than the sum of its proper divisors (1770362874200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1111203140200 is a wasteful number, since it uses less digits than its factorization.
1111203140200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12420 (or 12411 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1111203140200 its reverse (20413021111), we get a palindrome (1131616161311).
The spelling of 1111203140200 in words is "one trillion, one hundred eleven billion, two hundred three million, one hundred forty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •