Base | Representation |
---|---|
bin | 10010100001110011110000 |
3 | 100010202122120 |
4 | 102201303300 |
5 | 2220411242 |
6 | 252034240 |
7 | 56166363 |
oct | 22416360 |
9 | 10122576 |
10 | 4857072 |
11 | 2818210 |
12 | 1762980 |
13 | 1010a0c |
14 | 9060da |
15 | 65e1ec |
hex | 4a1cf0 |
4857072 has 40 divisors (see below), whose sum is σ = 13689600. Its totient is φ = 1471680.
The previous prime is 4857067. The next prime is 4857089. The reversal of 4857072 is 2707584.
It is a super-2 number, since 2×48570722 = 47182296826368, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an Ulam number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4072 + ... + 5127.
It is an arithmetic number, because the mean of its divisors is an integer number (342240).
Almost surely, 24857072 is an apocalyptic number.
It is an amenable number.
4857072 is an abundant number, since it is smaller than the sum of its proper divisors (8832528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4857072 is a wasteful number, since it uses less digits than its factorization.
4857072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9221 (or 9215 counting only the distinct ones).
The product of its (nonzero) digits is 15680, while the sum is 33.
The square root of 4857072 is about 2203.8765845664. The cubic root of 4857072 is about 169.3524616552.
It can be divided in two parts, 485 and 7072, that added together give a palindrome (7557).
The spelling of 4857072 in words is "four million, eight hundred fifty-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •