Base | Representation |
---|---|
bin | 1011000111010011000011… |
… | …0001011001000010110000 |
3 | 1121021012221211021210010212 |
4 | 2301310300301121002300 |
5 | 3100203030023223440 |
6 | 41553442434043252 |
7 | 2400602665652642 |
oct | 261646061310260 |
9 | 47235854253125 |
10 | 12220000211120 |
11 | 39915225a96a9 |
12 | 1454399419528 |
13 | 6a845845b7c0 |
14 | 303645ddc892 |
15 | 162d0c153465 |
hex | b1d30c590b0 |
12220000211120 has 80 divisors (see below), whose sum is σ = 30877707241920. Its totient is φ = 4470605540352.
The previous prime is 12220000211099. The next prime is 12220000211137. The reversal of 12220000211120 is 2111200002221.
It is a tau number, because it is divible by the number of its divisors (80).
It is a junction number, because it is equal to n+sod(n) for n = 12220000211095 and 12220000211104.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53785724 + ... + 54012443.
It is an arithmetic number, because the mean of its divisors is an integer number (385971340524).
Almost surely, 212220000211120 is an apocalyptic number.
12220000211120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12220000211120 is an abundant number, since it is smaller than the sum of its proper divisors (18657707030800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12220000211120 is a wasteful number, since it uses less digits than its factorization.
12220000211120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107798302 (or 107798296 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12220000211120 its reverse (2111200002221), we get a palindrome (14331200213341).
The spelling of 12220000211120 in words is "twelve trillion, two hundred twenty billion, two hundred eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •