Base | Representation |
---|---|
bin | 1110110000001000110… |
… | …01110000000000000000 |
3 | 1210110100100010220222100 |
4 | 13120010121300000000 |
5 | 31301042240000000 |
6 | 1024505113310400 |
7 | 51422646624363 |
oct | 7300431600000 |
9 | 1713310126870 |
10 | 506880000000 |
11 | 185a6a600310 |
12 | 822a1105400 |
13 | 38a4c629aaa |
14 | 1a766c640da |
15 | d2b9b46a00 |
hex | 7604670000 |
506880000000 has 816 divisors, whose sum is σ = 1996779653856. Its totient is φ = 122880000000.
The previous prime is 506879999999. The next prime is 506880000023. The reversal of 506880000000 is 88605.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 46079999995 + ... + 46080000005.
Almost surely, 2506880000000 is an apocalyptic number.
506880000000 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 506880000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (998389826928).
506880000000 is an abundant number, since it is smaller than the sum of its proper divisors (1489899653856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506880000000 is an frugal number, since it uses more digits than its factorization.
506880000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84 (or 21 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
Adding to 506880000000 its reverse (88605), we get a palindrome (506880088605).
The spelling of 506880000000 in words is "five hundred six billion, eight hundred eighty million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •