Base | Representation |
---|---|
bin | 1010011010011100… |
… | …1110100010000000 |
3 | 21012210212000002101 |
4 | 2212213032202000 |
5 | 21211044112432 |
6 | 1141213000144 |
7 | 126161444401 |
oct | 24647164200 |
9 | 7183760071 |
10 | 2795300992 |
11 | 1204969010 |
12 | 660183054 |
13 | 357173473 |
14 | 1c735d9a8 |
15 | 11560c4e7 |
hex | a69ce880 |
2795300992 has 96 divisors (see below), whose sum is σ = 6167381040. Its totient is φ = 1251532800.
The previous prime is 2795300951. The next prime is 2795300999. The reversal of 2795300992 is 2990035972.
It is not an unprimeable number, because it can be changed into a prime (2795300999) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 13247767 + ... + 13247977.
Almost surely, 22795300992 is an apocalyptic number.
2795300992 is a gapful number since it is divisible by the number (22) 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 2795300992, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3083690520).
2795300992 is an abundant number, since it is smaller than the sum of its proper divisors (3372080048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2795300992 is an equidigital number, since it uses as much as digits as its factorization.
2795300992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 430 (or 321 counting only the distinct ones).
The product of its (nonzero) digits is 306180, while the sum is 46.
The square root of 2795300992 is about 52870.6061247646. The cubic root of 2795300992 is about 1408.6708450962.
The spelling of 2795300992 in words is "two billion, seven hundred ninety-five million, three hundred thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •