Base | Representation |
---|---|
bin | 1001011010110011… |
… | …11111011000000000 |
3 | 111001102011210001122 |
4 | 10231121333120000 |
5 | 40324012131300 |
6 | 2153435451412 |
7 | 236211465350 |
oct | 45531773000 |
9 | 14042153048 |
10 | 5056755200 |
11 | 2165452032 |
12 | b915b6b68 |
13 | 627840953 |
14 | 35d836b60 |
15 | 1e8e17c85 |
hex | 12d67f600 |
5056755200 has 120 divisors (see below), whose sum is σ = 14318546352. Its totient is φ = 1733713920.
The previous prime is 5056755181. The next prime is 5056755203. The reversal of 5056755200 is 25576505.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5056755203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 61382 + ... + 117818.
Almost surely, 25056755200 is an apocalyptic number.
5056755200 is a gapful number since it is divisible by the number (50) 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 5056755200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7159273176).
5056755200 is an abundant number, since it is smaller than the sum of its proper divisors (9261791152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5056755200 is an equidigital number, since it uses as much as digits as its factorization.
5056755200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56472 (or 56451 counting only the distinct ones).
The product of its (nonzero) digits is 52500, while the sum is 35.
The square root of 5056755200 is about 71110.8655551316. The cubic root of 5056755200 is about 1716.4216212684.
The spelling of 5056755200 in words is "five billion, fifty-six million, seven hundred fifty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •