Base | Representation |
---|---|
bin | 11110101110001101011… |
… | …101010101100001001000 |
3 | 21110211101022102221021200 |
4 | 132232031131111201020 |
5 | 234042220232020404 |
6 | 4253512314304200 |
7 | 305346362531265 |
oct | 36561535254110 |
9 | 7424338387250 |
10 | 2111202220104 |
11 | 7443a068372a |
12 | 2a11b9428060 |
13 | 124115b52103 |
14 | 7427b5c026c |
15 | 39db58ed839 |
hex | 1eb8d755848 |
2111202220104 has 96 divisors (see below), whose sum is σ = 5755471296120. Its totient is φ = 699117631488.
The previous prime is 2111202220103. The next prime is 2111202220129. The reversal of 2111202220104 is 4010222021112.
It can be written as a sum of positive squares in 4 ways, for example, as 2068712643204 + 42489576900 = 1438302^2 + 206130^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (2111202220103) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6529584 + ... + 6845280.
Almost surely, 22111202220104 is an apocalyptic number.
2111202220104 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
2111202220104 is an abundant number, since it is smaller than the sum of its proper divisors (3644269076016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111202220104 is a wasteful number, since it uses less digits than its factorization.
2111202220104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 316319 (or 316312 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 2111202220104 its reverse (4010222021112), we get a palindrome (6121424241216).
The spelling of 2111202220104 in words is "two trillion, one hundred eleven billion, two hundred two million, two hundred twenty thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •