Base | Representation |
---|---|
bin | 1100110110000… |
… | …0011000000000 |
3 | 10202100222200000 |
4 | 3031200120000 |
5 | 102242402003 |
6 | 5202400000 |
7 | 1222622412 |
oct | 315403000 |
9 | 122328600 |
10 | 53872128 |
11 | 28455a22 |
12 | 16060000 |
13 | b2129cb |
14 | 72249b2 |
15 | 4ae21a3 |
hex | 3360600 |
53872128 has 120 divisors (see below), whose sum is σ = 161609448. Its totient is φ = 17915904.
The previous prime is 53872127. The next prime is 53872129. The reversal of 53872128 is 82127835.
It is an interprime number because it is at equal distance from previous prime (53872127) and next prime (53872129).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 53872092 and 53872101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53872127) 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, 124200 + ... + 124632.
Almost surely, 253872128 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 53872128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80804724).
53872128 is an abundant number, since it is smaller than the sum of its proper divisors (107737320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53872128 is an frugal number, since it uses more digits than its factorization.
53872128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 466 (or 438 counting only the distinct ones).
The product of its digits is 26880, while the sum is 36.
The square root of 53872128 is about 7339.7634839278. The cubic root of 53872128 is about 377.6777298565.
The spelling of 53872128 in words is "fifty-three million, eight hundred seventy-two thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •