Base | Representation |
---|---|
bin | 1010010101000001… |
… | …0001011000000000 |
3 | 21011012221220101120 |
4 | 2211100101120000 |
5 | 21134230143422 |
6 | 1135040232240 |
7 | 125463625125 |
oct | 24520213000 |
9 | 7135856346 |
10 | 2772506112 |
11 | 11a3009972 |
12 | 65460b680 |
13 | 352521b7c |
14 | 1c430874c |
15 | 11360845c |
hex | a5411600 |
2772506112 has 80 divisors (see below), whose sum is σ = 7707363840. Its totient is φ = 883976192.
The previous prime is 2772506083. The next prime is 2772506117. The reversal of 2772506112 is 2116052772.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2772506117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3912 + ... + 74567.
It is an arithmetic number, because the mean of its divisors is an integer number (96342048).
Almost surely, 22772506112 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 2772506112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3853681920).
2772506112 is an abundant number, since it is smaller than the sum of its proper divisors (4934857728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2772506112 is an equidigital number, since it uses as much as digits as its factorization.
2772506112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78523 (or 78507 counting only the distinct ones).
The product of its (nonzero) digits is 11760, while the sum is 33.
The square root of 2772506112 is about 52654.5925062572. The cubic root of 2772506112 is about 1404.8312866737.
Adding to 2772506112 its reverse (2116052772), we get a palindrome (4888558884).
The spelling of 2772506112 in words is "two billion, seven hundred seventy-two million, five hundred six thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •