Base | Representation |
---|---|
bin | 111000010110101111… |
… | …0101110010110110000 |
3 | 102120101020110100012220 |
4 | 1300231132232112300 |
5 | 3440323130110300 |
6 | 131332523521040 |
7 | 11513016663162 |
oct | 1605536562660 |
9 | 376336410186 |
10 | 121022113200 |
11 | 4736391197a |
12 | 1b556089180 |
13 | b548b97791 |
14 | 5c00dac932 |
15 | 3234aa3da0 |
hex | 1c2d7ae5b0 |
121022113200 has 60 divisors (see below), whose sum is σ = 387674173128. Its totient is φ = 32272563200.
The previous prime is 121022113187. The next prime is 121022113217. The reversal of 121022113200 is 2311220121.
It is a tau number, because it is divible by the number of its divisors (60).
It is a super-2 number, since 2×1210221132002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 121022113200.
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, 50424681 + ... + 50427080.
Almost surely, 2121022113200 is an apocalyptic number.
121022113200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121022113200 is an abundant number, since it is smaller than the sum of its proper divisors (266652059928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121022113200 is a wasteful number, since it uses less digits than its factorization.
121022113200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100851782 (or 100851771 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 121022113200 its reverse (2311220121), we get a palindrome (123333333321).
The spelling of 121022113200 in words is "one hundred twenty-one billion, twenty-two million, one hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •