Base | Representation |
---|---|
bin | 11011100010011001100110… |
… | …000111101101100010111000 |
3 | 120212211010011211201011020112 |
4 | 123202121212013231202320 |
5 | 111333241214441011300 |
6 | 1105325415005043452 |
7 | 34336665315604520 |
oct | 3342314607554270 |
9 | 525733154634215 |
10 | 121111201110200 |
11 | 35653a76734074 |
12 | 117001b4256588 |
13 | 52769779b4cb2 |
14 | 21c9b55dd8680 |
15 | e005a866de35 |
hex | 6e26661ed8b8 |
121111201110200 has 96 divisors (see below), whose sum is σ = 340739749072800. Its totient is φ = 39081261527040.
The previous prime is 121111201110199. The next prime is 121111201110247. The reversal of 121111201110200 is 2011102111121.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2544329165 + ... + 2544376764.
It is an arithmetic number, because the mean of its divisors is an integer number (3549372386175).
Almost surely, 2121111201110200 is an apocalyptic number.
121111201110200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121111201110200 is an abundant number, since it is smaller than the sum of its proper divisors (219628547962600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121111201110200 is a wasteful number, since it uses less digits than its factorization.
121111201110200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5088705969 (or 5088705960 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 121111201110200 its reverse (2011102111121), we get a palindrome (123122303221321).
The spelling of 121111201110200 in words is "one hundred twenty-one trillion, one hundred eleven billion, two hundred one million, one hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •