Base | Representation |
---|---|
bin | 1010010100100100… |
… | …0010011001101100 |
3 | 21011002101120002202 |
4 | 2211021002121230 |
5 | 21133234003042 |
6 | 1134531441032 |
7 | 125441536340 |
oct | 24511023154 |
9 | 7132346082 |
10 | 2770609772 |
11 | 11a1a34147 |
12 | 653a56178 |
13 | 352009988 |
14 | 1c3d73620 |
15 | 113381632 |
hex | a524266c |
2770609772 has 96 divisors (see below), whose sum is σ = 5852421120. Its totient is φ = 1122750720.
The previous prime is 2770609771. The next prime is 2770609781. The reversal of 2770609772 is 2779060772.
It is not an unprimeable number, because it can be changed into a prime (2770609771) 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 31 ways as a sum of consecutive naturals, for example, 13130747 + ... + 13130957.
It is an arithmetic number, because the mean of its divisors is an integer number (60962720).
Almost surely, 22770609772 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2770609772, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2926210560).
2770609772 is an abundant number, since it is smaller than the sum of its proper divisors (3081811348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2770609772 is a wasteful number, since it uses less digits than its factorization.
2770609772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 511 (or 509 counting only the distinct ones).
The product of its (nonzero) digits is 518616, while the sum is 47.
The square root of 2770609772 is about 52636.5820698875. The cubic root of 2770609772 is about 1404.5109212391.
The spelling of 2770609772 in words is "two billion, seven hundred seventy million, six hundred nine thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •