Base | Representation |
---|---|
bin | 1110100011011010101… |
… | …01010010100010100000 |
3 | 1202210201101020120111010 |
4 | 13101231111102202200 |
5 | 31143100412110330 |
6 | 1021415305420520 |
7 | 51061501103016 |
oct | 7215525224240 |
9 | 1683641216433 |
10 | 500050503840 |
11 | 183085522808 |
12 | 80ab5a9a740 |
13 | 382017515c4 |
14 | 1a2b9c0c8b6 |
15 | d01a2ac3b0 |
hex | 746d5528a0 |
500050503840 has 144 divisors (see below), whose sum is σ = 1673266345632. Its totient is φ = 125502836736.
The previous prime is 500050503839. The next prime is 500050503859. The reversal of 500050503840 is 48305050005.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 500050503798 and 500050503807.
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 23 ways as a sum of consecutive naturals, for example, 1663654 + ... + 1941093.
It is an arithmetic number, because the mean of its divisors is an integer number (11619905178).
Almost surely, 2500050503840 is an apocalyptic number.
It is an amenable number.
500050503840 is an abundant number, since it is smaller than the sum of its proper divisors (1173215841792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
500050503840 is a wasteful number, since it uses less digits than its factorization.
500050503840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3604799 (or 3604774 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 500050503840 its reverse (48305050005), we get a palindrome (548355553845).
The spelling of 500050503840 in words is "five hundred billion, fifty million, five hundred three thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •