Base | Representation |
---|---|
bin | 1100110010110… |
… | …1100011100000 |
3 | 10201222102010101 |
4 | 3030231203200 |
5 | 102214221333 |
6 | 5154112144 |
7 | 1221064501 |
oct | 314554340 |
9 | 121872111 |
10 | 53663968 |
11 | 28323596 |
12 | 15b7b654 |
13 | b16c037 |
14 | 71acba8 |
15 | 4aa067d |
hex | 332d8e0 |
53663968 has 48 divisors (see below), whose sum is σ = 116756640. Its totient is φ = 24150016.
The previous prime is 53663959. The next prime is 53663969. The reversal of 53663968 is 86936635.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (46).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53663969) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10368 + ... + 14656.
It is an arithmetic number, because the mean of its divisors is an integer number (2432430).
Almost surely, 253663968 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 53663968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (58378320).
53663968 is an abundant number, since it is smaller than the sum of its proper divisors (63092672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53663968 is a wasteful number, since it uses less digits than its factorization.
53663968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4339 (or 4331 counting only the distinct ones).
The product of its digits is 699840, while the sum is 46.
The square root of 53663968 is about 7325.5694659187. The cubic root of 53663968 is about 377.1906575034.
The spelling of 53663968 in words is "fifty-three million, six hundred sixty-three thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •