Base | Representation |
---|---|
bin | 10011010011101101100000 |
3 | 100112011000221 |
4 | 103103231200 |
5 | 2243431342 |
6 | 300252424 |
7 | 61010323 |
oct | 23235540 |
9 | 10464027 |
10 | 5061472 |
11 | 2947839 |
12 | 1841114 |
13 | 1082a70 |
14 | 95a7ba |
15 | 69ea67 |
hex | 4d3b60 |
5061472 has 48 divisors (see below), whose sum is σ = 11219040. Its totient is φ = 2234496.
The previous prime is 5061443. The next prime is 5061473. The reversal of 5061472 is 2741605.
5061472 = T13 + T14 + ... + T311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5061473) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 220053 + ... + 220075.
It is an arithmetic number, because the mean of its divisors is an integer number (233730).
Almost surely, 25061472 is an apocalyptic number.
5061472 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 5061472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5609520).
5061472 is an abundant number, since it is smaller than the sum of its proper divisors (6157568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5061472 is an equidigital number, since it uses as much as digits as its factorization.
5061472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92 (or 38 counting only the distinct ones).
The product of its (nonzero) digits is 1680, while the sum is 25.
The square root of 5061472 is about 2249.7715439573. The cubic root of 5061472 is about 171.6955132136.
The spelling of 5061472 in words is "five million, sixty-one thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •