Base | Representation |
---|---|
bin | 1010011000111100… |
… | …0001101100111110 |
3 | 21012100220200202100 |
4 | 2212033001230332 |
5 | 21202433110430 |
6 | 1140425005530 |
7 | 126053512641 |
oct | 24617015476 |
9 | 7170820670 |
10 | 2788956990 |
11 | 1201325736 |
12 | 65a0238a6 |
13 | 355a61a11 |
14 | 1c658ba58 |
15 | 114ca7960 |
hex | a63c1b3e |
2788956990 has 96 divisors (see below), whose sum is σ = 7777205280. Its totient is φ = 691262208.
The previous prime is 2788956967. The next prime is 2788956991. The reversal of 2788956990 is 996598872.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2788956991) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 75244 + ... + 106016.
It is an arithmetic number, because the mean of its divisors is an integer number (81012555).
Almost surely, 22788956990 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2788956990, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3888602640).
2788956990 is an abundant number, since it is smaller than the sum of its proper divisors (4988248290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2788956990 is a wasteful number, since it uses less digits than its factorization.
2788956990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30858 (or 30855 counting only the distinct ones).
The product of its (nonzero) digits is 19595520, while the sum is 63.
The square root of 2788956990 is about 52810.5764975161. The cubic root of 2788956990 is about 1407.6043672418.
The spelling of 2788956990 in words is "two billion, seven hundred eighty-eight million, nine hundred fifty-six thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •