Base | Representation |
---|---|
bin | 1001001100100010011111… |
… | …0100100111111010110000 |
3 | 1022210121022110001120011011 |
4 | 2103020213310213322300 |
5 | 2311124332401334300 |
6 | 33300534453000304 |
7 | 2062332346324426 |
oct | 223104764477260 |
9 | 38717273046134 |
10 | 10111021121200 |
11 | 324907291364a |
12 | 1173700623094 |
13 | 58460807914c |
14 | 26d539b9b116 |
15 | 1280269deeba |
hex | 93227d27eb0 |
10111021121200 has 30 divisors (see below), whose sum is σ = 24291728244644. Its totient is φ = 4044408448320.
The previous prime is 10111021121171. The next prime is 10111021121293. The reversal of 10111021121200 is 212112011101.
It is a happy number.
10111021121200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×101110211212002 (a number of 27 digits) contains 22 as substring.
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, 12638776002 + ... + 12638776801.
Almost surely, 210111021121200 is an apocalyptic number.
10111021121200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10111021121200 is an abundant number, since it is smaller than the sum of its proper divisors (14180707123444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111021121200 is a wasteful number, since it uses less digits than its factorization.
10111021121200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25277552821 (or 25277552810 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10111021121200 its reverse (212112011101), we get a palindrome (10323133132301).
The spelling of 10111021121200 in words is "ten trillion, one hundred eleven billion, twenty-one million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •