Base | Representation |
---|---|
bin | 10101110110101110000000 |
3 | 101210001220211 |
4 | 111312232000 |
5 | 2431313102 |
6 | 322443504 |
7 | 66461032 |
oct | 25665600 |
9 | 11701824 |
10 | 5729152 |
11 | 3263440 |
12 | 1b03594 |
13 | 1257940 |
14 | a91c52 |
15 | 7827d7 |
hex | 576b80 |
5729152 has 64 divisors (see below), whose sum is σ = 13451760. Its totient is φ = 2396160.
The previous prime is 5729147. The next prime is 5729161. The reversal of 5729152 is 2519275.
It is a tau number, because it is divible by the number of its divisors (64).
It is an Ulam number.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 18148 + ... + 18460.
Almost surely, 25729152 is an apocalyptic number.
5729152 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 5729152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6725880).
5729152 is an abundant number, since it is smaller than the sum of its proper divisors (7722608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5729152 is a wasteful number, since it uses less digits than its factorization.
5729152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 351 (or 339 counting only the distinct ones).
The product of its digits is 6300, while the sum is 31.
The square root of 5729152 is about 2393.5647056221. The cubic root of 5729152 is about 178.9356113929.
It can be divided in two parts, 572 and 9152, that multiplied together give a square (5234944 = 22882).
The spelling of 5729152 in words is "five million, seven hundred twenty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •