Base | Representation |
---|---|
bin | 1011000110001000100011… |
… | …0010101111000101110100 |
3 | 1121012022100010100121021011 |
4 | 2301202020302233011310 |
5 | 3044341101020401400 |
6 | 41540334213402004 |
7 | 2366264266005262 |
oct | 261421062570564 |
9 | 47168303317234 |
10 | 12200002122100 |
11 | 3983aa0165401 |
12 | 1450538039304 |
13 | 6a65bc2a2930 |
14 | 3026aa093432 |
15 | 16253b6638ba |
hex | b1888caf174 |
12200002122100 has 72 divisors (see below), whose sum is σ = 28518781755800. Its totient is φ = 4503302369280.
The previous prime is 12200002122089. The next prime is 12200002122137. The reversal of 12200002122100 is 122120000221.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 3713197965156 + 8486804156944 = 1926966^2 + 2913212^2 .
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3096076 + ... + 5829724.
Almost surely, 212200002122100 is an apocalyptic number.
12200002122100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12200002122100 is an abundant number, since it is smaller than the sum of its proper divisors (16318779633700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12200002122100 is a wasteful number, since it uses less digits than its factorization.
12200002122100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2737109 (or 2737102 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 12200002122100 its reverse (122120000221), we get a palindrome (12322122122321).
The spelling of 12200002122100 in words is "twelve trillion, two hundred billion, two million, one hundred twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •