Base | Representation |
---|---|
bin | 1011000001011110100110… |
… | …0011010110011010101000 |
3 | 1120220122220002221201022210 |
4 | 2300113221203112122220 |
5 | 3042033300400201300 |
6 | 41435505534445120 |
7 | 2360433264355356 |
oct | 260275143263250 |
9 | 46818802851283 |
10 | 12120021100200 |
11 | 3953087a40902 |
12 | 1438b366637a0 |
13 | 69bbb4084080 |
14 | 2dc87da587d6 |
15 | 160409b93050 |
hex | b05e98d66a8 |
12120021100200 has 192 divisors, whose sum is σ = 41225663888640. Its totient is φ = 2927099335680.
The previous prime is 12120021100193. The next prime is 12120021100223. The reversal of 12120021100200 is 200112002121.
It is a super-2 number, since 2×121200211002002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 14245552 + ... + 15072351.
It is an arithmetic number, because the mean of its divisors is an integer number (214716999420).
Almost surely, 212120021100200 is an apocalyptic number.
12120021100200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12120021100200 is an abundant number, since it is smaller than the sum of its proper divisors (29105642788440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12120021100200 is a wasteful number, since it uses less digits than its factorization.
12120021100200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29317988 (or 29317979 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 12120021100200 its reverse (200112002121), we get a palindrome (12320133102321).
The spelling of 12120021100200 in words is "twelve trillion, one hundred twenty billion, twenty-one million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •