Base | Representation |
---|---|
bin | 1011000110001001010010… |
… | …1110000011001001000100 |
3 | 1121012022212001212122010012 |
4 | 2301202110232003021010 |
5 | 3044342003232020400 |
6 | 41540410122245352 |
7 | 2366302245551336 |
oct | 261422456031104 |
9 | 47168761778105 |
10 | 12200202220100 |
11 | 3984093104a54 |
12 | 1450593056858 |
13 | 6a662189270b |
14 | 3026c889d456 |
15 | 16254dedbd35 |
hex | b1894b83244 |
12200202220100 has 36 divisors (see below), whose sum is σ = 26474592757200. Its totient is φ = 4880052512160.
The previous prime is 12200202220079. The next prime is 12200202220109. The reversal of 12200202220100 is 102220200221.
It is a super-2 number, since 2×122002022201002 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12200202220109) 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 11 ways as a sum of consecutive naturals, for example, 29089691 + ... + 29506109.
Almost surely, 212200202220100 is an apocalyptic number.
12200202220100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12200202220100 is an abundant number, since it is smaller than the sum of its proper divisors (14274390537100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12200202220100 is a wasteful number, since it uses less digits than its factorization.
12200202220100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 709412 (or 709405 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 12200202220100 its reverse (102220200221), we get a palindrome (12302422420321).
The spelling of 12200202220100 in words is "twelve trillion, two hundred billion, two hundred two million, two hundred twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •