Base | Representation |
---|---|
bin | 1100110100100… |
… | …0101001101000 |
3 | 10202012001100220 |
4 | 3031020221220 |
5 | 102231244302 |
6 | 5200330040 |
7 | 1222036200 |
oct | 315105150 |
9 | 122161326 |
10 | 53774952 |
11 | 28399a10 |
12 | 16013920 |
13 | b1aa6ca |
14 | 71db400 |
15 | 4ac34bc |
hex | 3348a68 |
53774952 has 96 divisors (see below), whose sum is σ = 170644320. Its totient is φ = 13964160.
The previous prime is 53774947. The next prime is 53774999. The reversal of 53774952 is 25947735.
It is a Smith number, since the sum of its digits (42) 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 (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10858 + ... + 15014.
It is an arithmetic number, because the mean of its divisors is an integer number (1777545).
Almost surely, 253774952 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 53774952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85322160).
53774952 is an abundant number, since it is smaller than the sum of its proper divisors (116869368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
53774952 is a wasteful number, since it uses less digits than its factorization.
53774952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4191 (or 4180 counting only the distinct ones).
The product of its digits is 264600, while the sum is 42.
The square root of 53774952 is about 7333.1406641357. The cubic root of 53774952 is about 377.4505047457.
The spelling of 53774952 in words is "fifty-three million, seven hundred seventy-four thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •