Base | Representation |
---|---|
bin | 11110010100110… |
… | …111110101011000 |
3 | 1022110101010000002 |
4 | 132110313311120 |
5 | 2020222204211 |
6 | 122253032132 |
7 | 15415425050 |
oct | 3624676530 |
9 | 1273333002 |
10 | 508788056 |
11 | 241219aa7 |
12 | 122485648 |
13 | 8154112a |
14 | 4b802560 |
15 | 2ea0203b |
hex | 1e537d58 |
508788056 has 32 divisors (see below), whose sum is σ = 1093443840. Its totient is φ = 217415328.
The previous prime is 508788029. The next prime is 508788067. The reversal of 508788056 is 650887805.
It is a Smith number, since the sum of its digits (47) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 508788056.
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 7 ways as a sum of consecutive naturals, for example, 6341 + ... + 32523.
It is an arithmetic number, because the mean of its divisors is an integer number (34170120).
Almost surely, 2508788056 is an apocalyptic number.
508788056 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
508788056 is an abundant number, since it is smaller than the sum of its proper divisors (584655784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
508788056 is a wasteful number, since it uses less digits than its factorization.
508788056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26543 (or 26539 counting only the distinct ones).
The product of its (nonzero) digits is 537600, while the sum is 47.
The square root of 508788056 is about 22556.3307299747. The cubic root of 508788056 is about 798.3236020662.
The spelling of 508788056 in words is "five hundred eight million, seven hundred eighty-eight thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •