Base | Representation |
---|---|
bin | 1011000001100011001011… |
… | …0111101000000101001000 |
3 | 1120220210001211111211110021 |
4 | 2300120302313220011020 |
5 | 3042043310243332300 |
6 | 41440231555030224 |
7 | 2360505621546661 |
oct | 260306267500510 |
9 | 46823054454407 |
10 | 12121251152200 |
11 | 3953659303103 |
12 | 143921a59b374 |
13 | 69c04bb6b0a8 |
14 | 2dc95916c368 |
15 | 16047cb67d1a |
hex | b0632de8148 |
12121251152200 has 48 divisors (see below), whose sum is σ = 28182336840000. Its totient is φ = 4848426841920.
The previous prime is 12121251152177. The next prime is 12121251152207. The reversal of 12121251152200 is 225115212121.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (12121251152207) 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, 13855381 + ... + 14704219.
It is an arithmetic number, because the mean of its divisors is an integer number (587132017500).
Almost surely, 212121251152200 is an apocalyptic number.
12121251152200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12121251152200 is an abundant number, since it is smaller than the sum of its proper divisors (16061085687800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12121251152200 is a wasteful number, since it uses less digits than its factorization.
12121251152200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 920254 (or 920245 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 25.
Adding to 12121251152200 its reverse (225115212121), we get a palindrome (12346366364321).
The spelling of 12121251152200 in words is "twelve trillion, one hundred twenty-one billion, two hundred fifty-one million, one hundred fifty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •