Base | Representation |
---|---|
bin | 1001011101010000… |
… | …00111111000000000 |
3 | 111002211201101011000 |
4 | 10232220013320000 |
5 | 40344233042443 |
6 | 2155450452000 |
7 | 236550542646 |
oct | 45650077000 |
9 | 14084641130 |
10 | 5077237248 |
11 | 2175a71546 |
12 | b98434000 |
13 | 62bb625c5 |
14 | 362449196 |
15 | 1eab118d3 |
hex | 12ea07e00 |
5077237248 has 80 divisors (see below), whose sum is σ = 15029015760. Its totient is φ = 1692407808.
The previous prime is 5077237241. The next prime is 5077237267. The reversal of 5077237248 is 8427327705.
5077237248 is a `hidden beast` number, since 507 + 72 + 3 + 72 + 4 + 8 = 666.
It is a super-2 number, since 2×50772372482 = 51556676144957227008, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5077237241) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 169815 + ... + 197462.
It is an arithmetic number, because the mean of its divisors is an integer number (187862697).
Almost surely, 25077237248 is an apocalyptic number.
It is an amenable number.
5077237248 is an abundant number, since it is smaller than the sum of its proper divisors (9951778512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5077237248 is an equidigital number, since it uses as much as digits as its factorization.
5077237248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367304 (or 367282 counting only the distinct ones).
The product of its (nonzero) digits is 658560, while the sum is 45.
The square root of 5077237248 is about 71254.7349163549. The cubic root of 5077237248 is about 1718.7359163531.
The spelling of 5077237248 in words is "five billion, seventy-seven million, two hundred thirty-seven thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •