Base | Representation |
---|---|
bin | 10101111111111111110000 |
3 | 101212000001020 |
4 | 111333333300 |
5 | 2434022102 |
6 | 323335440 |
7 | 100006566 |
oct | 25777760 |
9 | 11760036 |
10 | 5767152 |
11 | 3289a46 |
12 | 1b21580 |
13 | 126c021 |
14 | aa1a36 |
15 | 78dbbc |
hex | 57fff0 |
5767152 has 40 divisors (see below), whose sum is σ = 15024336. Its totient is φ = 1906176.
The previous prime is 5767129. The next prime is 5767169. The reversal of 5767152 is 2517675.
It is a super-2 number, since 2×57671522 = 66520084382208, which contains 22 as substring.
It is an Ulam number.
It is a zygodrome in base 4.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6138 + ... + 7014.
Almost surely, 25767152 is an apocalyptic number.
It is an amenable number.
5767152 is an abundant number, since it is smaller than the sum of its proper divisors (9257184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5767152 is a wasteful number, since it uses less digits than its factorization.
5767152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1025 (or 1019 counting only the distinct ones).
The product of its digits is 14700, while the sum is 33.
The square root of 5767152 is about 2401.4895377661. The cubic root of 5767152 is about 179.3303513214.
The spelling of 5767152 in words is "five million, seven hundred sixty-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •