Base | Representation |
---|---|
bin | 111110111000101… |
… | …1110100000001000 |
3 | 12110001120022012101 |
4 | 1331301132200020 |
5 | 13310142400432 |
6 | 545215123144 |
7 | 103201512106 |
oct | 17561364010 |
9 | 5401508171 |
10 | 2110121992 |
11 | 993121980 |
12 | 4aa8134b4 |
13 | 2782230c4 |
14 | 160362c76 |
15 | c53b64e7 |
hex | 7dc5e808 |
2110121992 has 16 divisors (see below), whose sum is σ = 4316158800. Its totient is φ = 959146320.
The previous prime is 2110121977. The next prime is 2110121999. The reversal of 2110121992 is 2991210112.
It is a super-2 number, since 2×21101219922 = 8905229642244096128, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2110121992.
It is not an unprimeable number, because it can be changed into a prime (2110121999) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11989242 + ... + 11989417.
It is an arithmetic number, because the mean of its divisors is an integer number (269759925).
Almost surely, 22110121992 is an apocalyptic number.
2110121992 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2110121992 is an abundant number, since it is smaller than the sum of its proper divisors (2206036808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2110121992 is a wasteful number, since it uses less digits than its factorization.
2110121992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23978676 (or 23978672 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 28.
The square root of 2110121992 is about 45936.0641762004. The cubic root of 2110121992 is about 1282.6333303899.
The spelling of 2110121992 in words is "two billion, one hundred ten million, one hundred twenty-one thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •