Base | Representation |
---|---|
bin | 101110000001100… |
… | …011101001110000 |
3 | 1222210221210112200 |
4 | 232001203221300 |
5 | 3040133110422 |
6 | 204342023200 |
7 | 25064152443 |
oct | 5601435160 |
9 | 1883853480 |
10 | 772160112 |
11 | 366956359 |
12 | 196717b00 |
13 | c3c86199 |
14 | 7479d65a |
15 | 47bc82ac |
hex | 2e063a70 |
772160112 has 60 divisors (see below), whose sum is σ = 2177525064. Its totient is φ = 255415680.
The previous prime is 772160101. The next prime is 772160113. The reversal of 772160112 is 211061277.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (772160113) 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, 1603 + ... + 39330.
Almost surely, 2772160112 is an apocalyptic number.
772160112 is a gapful number since it is divisible by the number (72) 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 772160112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1088762532).
772160112 is an abundant number, since it is smaller than the sum of its proper divisors (1405364952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
772160112 is a wasteful number, since it uses less digits than its factorization.
772160112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41078 (or 41069 counting only the distinct ones).
The product of its (nonzero) digits is 1176, while the sum is 27.
The square root of 772160112 is about 27787.7691080087. The cubic root of 772160112 is about 917.4219380361.
The spelling of 772160112 in words is "seven hundred seventy-two million, one hundred sixty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •