Base | Representation |
---|---|
bin | 111110010111111… |
… | …1100001010001000 |
3 | 12101212020110121220 |
4 | 1330233330022020 |
5 | 13241243120320 |
6 | 543403002040 |
7 | 102602466414 |
oct | 17457741210 |
9 | 5355213556 |
10 | 2092941960 |
11 | 9844582aa |
12 | 4a4b09320 |
13 | 2747b93c5 |
14 | 15bd6dd44 |
15 | c3b20e40 |
hex | 7cbfc288 |
2092941960 has 128 divisors (see below), whose sum is σ = 6750259200. Its totient is φ = 517466880.
The previous prime is 2092941953. The next prime is 2092941973. The reversal of 2092941960 is 691492902.
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 31 ways as a sum of consecutive naturals, for example, 97395 + ... + 116925.
It is an arithmetic number, because the mean of its divisors is an integer number (52736400).
Almost surely, 22092941960 is an apocalyptic number.
2092941960 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2092941960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3375129600).
2092941960 is an abundant number, since it is smaller than the sum of its proper divisors (4657317240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2092941960 is a wasteful number, since it uses less digits than its factorization.
2092941960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19611 (or 19607 counting only the distinct ones).
The product of its (nonzero) digits is 69984, while the sum is 42.
The square root of 2092941960 is about 45748.6826039833. The cubic root of 2092941960 is about 1279.1428913636.
The spelling of 2092941960 in words is "two billion, ninety-two million, nine hundred forty-one thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •