Base | Representation |
---|---|
bin | 1010011001001100… |
… | …0101000011100100 |
3 | 21012102220122222011 |
4 | 2212103011003210 |
5 | 21203221104200 |
6 | 1140503444004 |
7 | 126065526025 |
oct | 24623050344 |
9 | 7172818864 |
10 | 2790019300 |
11 | 1201990882 |
12 | 65a456604 |
13 | 3560443c3 |
14 | 1c6786c4c |
15 | 114e175ba |
hex | a64c50e4 |
2790019300 has 72 divisors (see below), whose sum is σ = 6168355200. Its totient is φ = 1095169920.
The previous prime is 2790019289. The next prime is 2790019333. The reversal of 2790019300 is 39100972.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1413114 + ... + 1415086.
It is an arithmetic number, because the mean of its divisors is an integer number (85671600).
Almost surely, 22790019300 is an apocalyptic number.
2790019300 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 2790019300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3084177600).
2790019300 is an abundant number, since it is smaller than the sum of its proper divisors (3378335900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2790019300 is a wasteful number, since it uses less digits than its factorization.
2790019300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2245 (or 2238 counting only the distinct ones).
The product of its (nonzero) digits is 3402, while the sum is 31.
The square root of 2790019300 is about 52820.6332790511. The cubic root of 2790019300 is about 1407.7830627645.
The spelling of 2790019300 in words is "two billion, seven hundred ninety million, nineteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •