Base | Representation |
---|---|
bin | 111110111000100… |
… | …1101101100010100 |
3 | 12110001102210202022 |
4 | 1331301031230110 |
5 | 13310133200030 |
6 | 545213432312 |
7 | 103201104266 |
oct | 17561155424 |
9 | 5401383668 |
10 | 2110053140 |
11 | 993085178 |
12 | 4aa79b698 |
13 | 2781ca970 |
14 | 160345b36 |
15 | c53a0de5 |
hex | 7dc4db14 |
2110053140 has 48 divisors (see below), whose sum is σ = 4777088400. Its totient is φ = 778260480.
The previous prime is 2110053083. The next prime is 2110053157. The reversal of 2110053140 is 413500112.
It can be written as a sum of positive squares in 8 ways, for example, as 437897476 + 1672155664 = 20926^2 + 40892^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 272036 + ... + 279684.
It is an arithmetic number, because the mean of its divisors is an integer number (99522675).
Almost surely, 22110053140 is an apocalyptic number.
2110053140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2110053140 is an abundant number, since it is smaller than the sum of its proper divisors (2667035260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2110053140 is a wasteful number, since it uses less digits than its factorization.
2110053140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8732 (or 8730 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 2110053140 is about 45935.3147371388. The cubic root of 2110053140 is about 1282.6193797224.
Adding to 2110053140 its reverse (413500112), we get a palindrome (2523553252).
The spelling of 2110053140 in words is "two billion, one hundred ten million, fifty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •