Base | Representation |
---|---|
bin | 1001011010101110… |
… | …01100001100001100 |
3 | 111001100210111021200 |
4 | 10231113030030030 |
5 | 40323320140020 |
6 | 2153412025500 |
7 | 236202320523 |
oct | 45527141414 |
9 | 14040714250 |
10 | 5056021260 |
11 | 2164aa0674 |
12 | b91302290 |
13 | 627644874 |
14 | 35d6c54ba |
15 | 1e8d20590 |
hex | 12d5cc30c |
5056021260 has 144 divisors (see below), whose sum is σ = 15864925440. Its totient is φ = 1302013440.
The previous prime is 5056021247. The next prime is 5056021273. The reversal of 5056021260 is 621206505.
5056021260 is a `hidden beast` number, since 50 + 5 + 602 + 1 + 2 + 6 + 0 = 666.
It is an interprime number because it is at equal distance from previous prime (5056021247) and next prime (5056021273).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4625274 + ... + 4626366.
Almost surely, 25056021260 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5056021260, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7932462720).
5056021260 is an abundant number, since it is smaller than the sum of its proper divisors (10808904180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5056021260 is a wasteful number, since it uses less digits than its factorization.
5056021260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1968 (or 1963 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 5056021260 is about 71105.7048344224. The cubic root of 5056021260 is about 1716.3385764840.
Adding to 5056021260 its reverse (621206505), we get a palindrome (5677227765).
The spelling of 5056021260 in words is "five billion, fifty-six million, twenty-one thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •