Base | Representation |
---|---|
bin | 1001001100100010011010… |
… | …0100000110000111000000 |
3 | 1022210121020222100001200022 |
4 | 2103020212210012013000 |
5 | 2311124312000324300 |
6 | 33300532420313012 |
7 | 2062332002023304 |
oct | 223104644060700 |
9 | 38717228301608 |
10 | 10111000011200 |
11 | 3249061a05370 |
12 | 11736b5542768 |
13 | 58460389771a |
14 | 26d537063d04 |
15 | 128024c20285 |
hex | 932269061c0 |
10111000011200 has 168 divisors, whose sum is σ = 28077044003280. Its totient is φ = 3549943398400.
The previous prime is 10111000011193. The next prime is 10111000011209. The reversal of 10111000011200 is 211000011101.
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 not an unprimeable number, because it can be changed into a prime (10111000011209) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9394577 + ... + 10415376.
Almost surely, 210111000011200 is an apocalyptic number.
10111000011200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10111000011200 is an abundant number, since it is smaller than the sum of its proper divisors (17966043992080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111000011200 is a wasteful number, since it uses less digits than its factorization.
10111000011200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19810015 (or 19810000 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 10111000011200 its reverse (211000011101), we get a palindrome (10322000022301).
Subtracting from 10111000011200 its reverse (211000011101), we obtain a palindrome (9900000000099).
The spelling of 10111000011200 in words is "ten trillion, one hundred eleven billion, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •