Base | Representation |
---|---|
bin | 1001011010111010… |
… | …11001011010011000 |
3 | 111001110212011010200 |
4 | 10231131121122120 |
5 | 40324224221110 |
6 | 2153510542200 |
7 | 236222205156 |
oct | 45535313230 |
9 | 14043764120 |
10 | 5057648280 |
11 | 2165a02013 |
12 | b91967960 |
13 | 627a942b9 |
14 | 35d9ca3d6 |
15 | 1e90426c0 |
hex | 12d759698 |
5057648280 has 48 divisors (see below), whose sum is σ = 16437358080. Its totient is φ = 1348706112.
The previous prime is 5057648263. The next prime is 5057648369. The reversal of 5057648280 is 828467505.
5057648280 is a `hidden beast` number, since 50 + 576 + 4 + 8 + 28 + 0 = 666.
It is a super-2 number, since 2×50576482802 = 51159612248373916800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
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 11 ways as a sum of consecutive naturals, for example, 7024152 + ... + 7024871.
It is an arithmetic number, because the mean of its divisors is an integer number (342444960).
Almost surely, 25057648280 is an apocalyptic number.
It is an amenable number.
5057648280 is an abundant number, since it is smaller than the sum of its proper divisors (11379709800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5057648280 is a wasteful number, since it uses less digits than its factorization.
5057648280 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14049040 (or 14049033 counting only the distinct ones).
The product of its (nonzero) digits is 537600, while the sum is 45.
The square root of 5057648280 is about 71117.1447683328. The cubic root of 5057648280 is about 1716.5226617926.
The spelling of 5057648280 in words is "five billion, fifty-seven million, six hundred forty-eight thousand, two hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •