Base | Representation |
---|---|
bin | 111110110110110… |
… | …0111111011010100 |
3 | 12102222122222210000 |
4 | 1331231213323110 |
5 | 13304413041040 |
6 | 545141331300 |
7 | 103160104431 |
oct | 17555477324 |
9 | 5388588700 |
10 | 2109112020 |
11 | 9925a2094 |
12 | 4aa406b30 |
13 | 277c5b4a2 |
14 | 16017cb88 |
15 | c5267130 |
hex | 7db67ed4 |
2109112020 has 60 divisors (see below), whose sum is σ = 6616367604. Its totient is φ = 562429440.
The previous prime is 2109112009. The next prime is 2109112067. The reversal of 2109112020 is 202119012.
It can be written as a sum of positive squares in 2 ways, for example, as 1247219856 + 861892164 = 35316^2 + 29358^2 .
It is a tau number, because it is divible by the number of its divisors (60).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 2109111984 and 2109112002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 649341 + ... + 652580.
Almost surely, 22109112020 is an apocalyptic number.
2109112020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2109112020 is an abundant number, since it is smaller than the sum of its proper divisors (4507255584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2109112020 is a wasteful number, since it uses less digits than its factorization.
2109112020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1301942 (or 1301931 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
The square root of 2109112020 is about 45925.0696243348. The cubic root of 2109112020 is about 1282.4286612622.
The spelling of 2109112020 in words is "two billion, one hundred nine million, one hundred twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •