Base | Representation |
---|---|
bin | 10011110111010011011000 |
3 | 100210120000100 |
4 | 103313103120 |
5 | 2313113011 |
6 | 303335400 |
7 | 62155335 |
oct | 23672330 |
9 | 10716010 |
10 | 5207256 |
11 | 2a3731a |
12 | 18b1560 |
13 | 1104222 |
14 | 99798c |
15 | 6ccd56 |
hex | 4f74d8 |
5207256 has 48 divisors (see below), whose sum is σ = 14564160. Its totient is φ = 1679040.
The previous prime is 5207249. The next prime is 5207261. The reversal of 5207256 is 6527025.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1066 + ... + 3398.
It is an arithmetic number, because the mean of its divisors is an integer number (303420).
Almost surely, 25207256 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 5207256, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7282080).
5207256 is an abundant number, since it is smaller than the sum of its proper divisors (9356904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5207256 is a wasteful number, since it uses less digits than its factorization.
5207256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2376 (or 2369 counting only the distinct ones).
The product of its (nonzero) digits is 4200, while the sum is 27.
The square root of 5207256 is about 2281.9412788238. The cubic root of 5207256 is about 173.3283660641.
It can be divided in two parts, 520 and 7256, that added together give a 5-th power (7776 = 65).
The spelling of 5207256 in words is "five million, two hundred seven thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •