Base | Representation |
---|---|
bin | 1100101000111… |
… | …1011001000100 |
3 | 10200202111110110 |
4 | 3022033121010 |
5 | 102033004012 |
6 | 5132153020 |
7 | 1212425661 |
oct | 312173104 |
9 | 120674413 |
10 | 53016132 |
11 | 27a20894 |
12 | 15908770 |
13 | aca31c0 |
14 | 7080a68 |
15 | 49c373c |
hex | 328f644 |
53016132 has 48 divisors (see below), whose sum is σ = 141063552. Its totient is φ = 15352320.
The previous prime is 53016091. The next prime is 53016133. The reversal of 53016132 is 23161035.
It is a junction number, because it is equal to n+sod(n) for n = 53016099 and 53016108.
It is not an unprimeable number, because it can be changed into a prime (53016133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7344 + ... + 12647.
It is an arithmetic number, because the mean of its divisors is an integer number (2938824).
Almost surely, 253016132 is an apocalyptic number.
53016132 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
53016132 is an abundant number, since it is smaller than the sum of its proper divisors (88047420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53016132 is a wasteful number, since it uses less digits than its factorization.
53016132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20028 (or 20026 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 53016132 is about 7281.2177552934. The cubic root of 53016132 is about 375.6666825006. Note that the first 4 decimals are identical.
Adding to 53016132 its reverse (23161035), we get a palindrome (76177167).
The spelling of 53016132 in words is "fifty-three million, sixteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •