Base | Representation |
---|---|
bin | 111000100011100100… |
… | …0100001110010111000 |
3 | 102121111020022100221020 |
4 | 1301013020201302320 |
5 | 3442213320032300 |
6 | 131443340342440 |
7 | 11526464143461 |
oct | 1610710416270 |
9 | 377436270836 |
10 | 121452502200 |
11 | 47564853567 |
12 | 1b656244a20 |
13 | b5b70b9123 |
14 | 5c42203d68 |
15 | 325c76b8a0 |
hex | 1c47221cb8 |
121452502200 has 48 divisors (see below), whose sum is σ = 376502758680. Its totient is φ = 32387333760.
The previous prime is 121452502187. The next prime is 121452502201. The reversal of 121452502200 is 2205254121.
121452502200 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121452502201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 101209819 + ... + 101211018.
Almost surely, 2121452502200 is an apocalyptic number.
121452502200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121452502200 is an abundant number, since it is smaller than the sum of its proper divisors (255050256480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121452502200 is a wasteful number, since it uses less digits than its factorization.
121452502200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 202420856 (or 202420847 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 24.
Adding to 121452502200 its reverse (2205254121), we get a palindrome (123657756321).
The spelling of 121452502200 in words is "one hundred twenty-one billion, four hundred fifty-two million, five hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •