Base | Representation |
---|---|
bin | 1010000000110111110111… |
… | …0000010111110101101000 |
3 | 1102222120000120022022112202 |
4 | 2200031331300113311220 |
5 | 2420342201404342300 |
6 | 35225550345355332 |
7 | 2214311546314106 |
oct | 240157560276550 |
9 | 42876016268482 |
10 | 11010111012200 |
11 | 35653a86a7043 |
12 | 12999bba98b48 |
13 | 61b33110c501 |
14 | 2a0c6c354c76 |
15 | 1415e9194ad5 |
hex | a037dc17d68 |
11010111012200 has 24 divisors (see below), whose sum is σ = 25598508103830. Its totient is φ = 4404044404800.
The previous prime is 11010111012161. The next prime is 11010111012283. The reversal of 11010111012200 is 221011101011.
11010111012200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 9012688468996 + 1997422543204 = 3002114^2 + 1413302^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 27525277331 + ... + 27525277730.
Almost surely, 211010111012200 is an apocalyptic number.
11010111012200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11010111012200 is an abundant number, since it is smaller than the sum of its proper divisors (14588397091630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010111012200 is a wasteful number, since it uses less digits than its factorization.
11010111012200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55050555077 (or 55050555068 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 11010111012200 its reverse (221011101011), we get a palindrome (11231122113211).
The spelling of 11010111012200 in words is "eleven trillion, ten billion, one hundred eleven million, twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •