Base | Representation |
---|---|
bin | 1100110100100… |
… | …1001100000000 |
3 | 10202012011101101 |
4 | 3031021030000 |
5 | 102231332102 |
6 | 5200344144 |
7 | 1222045462 |
oct | 315111400 |
9 | 122164341 |
10 | 53777152 |
11 | 283a0630 |
12 | 16015054 |
13 | b1ab700 |
14 | 71dc132 |
15 | 4ac3e87 |
hex | 3349300 |
53777152 has 108 divisors (see below), whose sum is σ = 127925784. Its totient is φ = 22364160.
The previous prime is 53777089. The next prime is 53777153. The reversal of 53777152 is 25177735.
It is a super-2 number, since 2×537771522 = 5783964154462208, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (53777153) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 475848 + ... + 475960.
It is an arithmetic number, because the mean of its divisors is an integer number (1184498).
Almost surely, 253777152 is an apocalyptic number.
53777152 is a gapful number since it is divisible by the number (52) 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 53777152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63962892).
53777152 is an abundant number, since it is smaller than the sum of its proper divisors (74148632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53777152 is a wasteful number, since it uses less digits than its factorization.
53777152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166 (or 139 counting only the distinct ones).
The product of its digits is 51450, while the sum is 37.
The square root of 53777152 is about 7333.2906665425. The cubic root of 53777152 is about 377.4556519983.
The spelling of 53777152 in words is "fifty-three million, seven hundred seventy-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •