Base | Representation |
---|---|
bin | 1110110100010110011… |
… | …10010000001000100011 |
3 | 1210200011222022212020200 |
4 | 13122023032100020203 |
5 | 31320210312110201 |
6 | 1025521354040243 |
7 | 51533003554335 |
oct | 7321316201043 |
9 | 1720158285220 |
10 | 509141910051 |
11 | 186a20375865 |
12 | 82812719083 |
13 | 390201268c8 |
14 | 1a8dd419455 |
15 | d39d4e2386 |
hex | 768b390223 |
509141910051 has 12 divisors (see below), whose sum is σ = 740362958400. Its totient is φ = 337149899280.
The previous prime is 509141910019. The next prime is 509141910071. The reversal of 509141910051 is 150019141905.
509141910051 is a `hidden beast` number, since 5 + 0 + 91 + 419 + 100 + 51 = 666.
It is not a de Polignac number, because 509141910051 - 25 = 509141910019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 509141909988 and 509141910015.
It is not an unprimeable number, because it can be changed into a prime (509141910071) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 189835315 + ... + 189837996.
It is an arithmetic number, because the mean of its divisors is an integer number (61696913200).
Almost surely, 2509141910051 is an apocalyptic number.
509141910051 is a deficient number, since it is larger than the sum of its proper divisors (231221048349).
509141910051 is a wasteful number, since it uses less digits than its factorization.
509141910051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379673466 (or 379673463 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 36.
The spelling of 509141910051 in words is "five hundred nine billion, one hundred forty-one million, nine hundred ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •