Base | Representation |
---|---|
bin | 1110110101010110111… |
… | …10000110110101001100 |
3 | 1210201120200100212220220 |
4 | 13122223132012311030 |
5 | 31322312312442124 |
6 | 1030051202111340 |
7 | 51552263325012 |
oct | 7325336066514 |
9 | 1721520325826 |
10 | 509682937164 |
11 | 187178804505 |
12 | 8294394b550 |
13 | 390a8244bab |
14 | 1a9512108b2 |
15 | d3d0c61879 |
hex | 76ab786d4c |
509682937164 has 96 divisors (see below), whose sum is σ = 1225205194752. Its totient is φ = 164825544000.
The previous prime is 509682937163. The next prime is 509682937177. The reversal of 509682937164 is 461739286905.
It is a super-2 number, since 2×5096829371642 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 509682937098 and 509682937107.
It is not an unprimeable number, because it can be changed into a prime (509682937163) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 76171059 + ... + 76177749.
It is an arithmetic number, because the mean of its divisors is an integer number (12762554112).
It is a 2-persistent number, because it is pandigital, and so is 2⋅509682937164 = 1019365874328, but 3⋅509682937164 = 1529048811492 is not.
Almost surely, 2509682937164 is an apocalyptic number.
It is an amenable number.
509682937164 is an abundant number, since it is smaller than the sum of its proper divisors (715522257588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
509682937164 is a wasteful number, since it uses less digits than its factorization.
509682937164 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7907 (or 7905 counting only the distinct ones).
The product of its (nonzero) digits is 19595520, while the sum is 60.
The spelling of 509682937164 in words is "five hundred nine billion, six hundred eighty-two million, nine hundred thirty-seven thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •