Base | Representation |
---|---|
bin | 1100101001101… |
… | …0100000000000 |
3 | 10200211210212122 |
4 | 3022122200000 |
5 | 102040433012 |
6 | 5133143412 |
7 | 1213005431 |
oct | 312324000 |
9 | 120753778 |
10 | 53061632 |
11 | 27a51a98 |
12 | 1592ab68 |
13 | acbab20 |
14 | 7093488 |
15 | 49d1e72 |
hex | 329a800 |
53061632 has 48 divisors (see below), whose sum is σ = 114316020. Its totient is φ = 24477696.
The previous prime is 53061601. The next prime is 53061649. The reversal of 53061632 is 23616035.
It can be written as a sum of positive squares in 2 ways, for example, as 52765696 + 295936 = 7264^2 + 544^2 .
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25628 + ... + 27620.
Almost surely, 253061632 is an apocalyptic number.
53061632 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 53061632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57158010).
53061632 is an abundant number, since it is smaller than the sum of its proper divisors (61254388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53061632 is a wasteful number, since it uses less digits than its factorization.
53061632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2028 (or 2008 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 26.
The square root of 53061632 is about 7284.3415625573. The cubic root of 53061632 is about 375.7741211605.
Adding to 53061632 its reverse (23616035), we get a palindrome (76677667).
The spelling of 53061632 in words is "fifty-three million, sixty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •