Base | Representation |
---|---|
bin | 111000010110000111… |
… | …0101001100110011000 |
3 | 102120022202221212222110 |
4 | 1300230032221212120 |
5 | 3440302241402300 |
6 | 131330453552320 |
7 | 11512343366010 |
oct | 1605416514630 |
9 | 376282855873 |
10 | 121001122200 |
11 | 47352a85042 |
12 | 1b54b0456a0 |
13 | b54472827a |
14 | 5bdc2a6c40 |
15 | 3232d09550 |
hex | 1c2c3a9998 |
121001122200 has 192 divisors, whose sum is σ = 440276463360. Its totient is φ = 26909867520.
The previous prime is 121001122189. The next prime is 121001122201. The reversal of 121001122200 is 2221100121.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121001122201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 233922 + ... + 544721.
It is an arithmetic number, because the mean of its divisors is an integer number (2293106580).
Almost surely, 2121001122200 is an apocalyptic number.
121001122200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121001122200 is an abundant number, since it is smaller than the sum of its proper divisors (319275341160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121001122200 is a wasteful number, since it uses less digits than its factorization.
121001122200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 778706 (or 778697 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 121001122200 its reverse (2221100121), we get a palindrome (123222222321).
The spelling of 121001122200 in words is "one hundred twenty-one billion, one million, one hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •