Base | Representation |
---|---|
bin | 11011100010011001100000… |
… | …110100100011001111110000 |
3 | 120212211002221122102010000121 |
4 | 123202121200310203033300 |
5 | 111333241024210414300 |
6 | 1105325402111300024 |
7 | 34336663156104562 |
oct | 3342314064431760 |
9 | 525732848363017 |
10 | 121111112201200 |
11 | 35653a30528460 |
12 | 1170018a51a614 |
13 | 5276962455814 |
14 | 21c9b48293332 |
15 | e005a095a81a |
hex | 6e2660d233f0 |
121111112201200 has 60 divisors (see below), whose sum is σ = 317421214989768. Its totient is φ = 44040404435200.
The previous prime is 121111112201159. The next prime is 121111112201329. The reversal of 121111112201200 is 2102211111121.
It is a super-2 number, since 2×1211111122012002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13762621987 + ... + 13762630786.
Almost surely, 2121111112201200 is an apocalyptic number.
121111112201200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121111112201200 is an abundant number, since it is smaller than the sum of its proper divisors (196310102788568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121111112201200 is a wasteful number, since it uses less digits than its factorization.
121111112201200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27525252802 (or 27525252791 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 121111112201200 its reverse (2102211111121), we get a palindrome (123213323312321).
The spelling of 121111112201200 in words is "one hundred twenty-one trillion, one hundred eleven billion, one hundred twelve million, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •