Base | Representation |
---|---|
bin | 1011000001100110101101… |
… | …1011111111101100011000 |
3 | 1120220212111222022222021120 |
4 | 2300121223123333230120 |
5 | 3042102231223211300 |
6 | 41440510100405240 |
7 | 2360541264450633 |
oct | 260315333775430 |
9 | 46825458288246 |
10 | 12122200210200 |
11 | 3953aa5aa2463 |
12 | 14394443a6820 |
13 | 69c170680182 |
14 | 2dca09218c1a |
15 | 1604d61353a0 |
hex | b066b6ffb18 |
12122200210200 has 192 divisors, whose sum is σ = 41161386708000. Its totient is φ = 2937522954240.
The previous prime is 12122200210187. The next prime is 12122200210207. The reversal of 12122200210200 is 201200222121.
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 12122200210200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12122200210207) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 20194735 + ... + 20786334.
Almost surely, 212122200210200 is an apocalyptic number.
12122200210200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12122200210200 is an abundant number, since it is smaller than the sum of its proper divisors (29039186497800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12122200210200 is a wasteful number, since it uses less digits than its factorization.
12122200210200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40981134 (or 40981125 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 12122200210200 its reverse (201200222121), we get a palindrome (12323400432321).
The spelling of 12122200210200 in words is "twelve trillion, one hundred twenty-two billion, two hundred million, two hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •