Base | Representation |
---|---|
bin | 1110110111110110011… |
… | …01000010011111100001 |
3 | 1210212000220111020112201 |
4 | 13123323031002133201 |
5 | 31333032240441400 |
6 | 1030432025453201 |
7 | 51630365525644 |
oct | 7337315023741 |
9 | 1725026436481 |
10 | 511020640225 |
11 | 1877a4913627 |
12 | 83057941201 |
13 | 3925c421074 |
14 | 1aa3ab47a5b |
15 | d45d3ed06a |
hex | 76fb3427e1 |
511020640225 has 24 divisors (see below), whose sum is σ = 634945854168. Its totient is φ = 407991091200.
The previous prime is 511020640219. The next prime is 511020640243. The reversal of 511020640225 is 522046020115.
It can be written as a sum of positive squares in 12 ways, for example, as 251345806336 + 259674833889 = 501344^2 + 509583^2 .
It is not a de Polignac number, because 511020640225 - 213 = 511020632033 is a prime.
It is a super-2 number, since 2×5110206402252 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 511020640193 and 511020640202.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 51838497 + ... + 51848353.
It is an arithmetic number, because the mean of its divisors is an integer number (26456077257).
Almost surely, 2511020640225 is an apocalyptic number.
It is an amenable number.
511020640225 is a deficient number, since it is larger than the sum of its proper divisors (123925213943).
511020640225 is a wasteful number, since it uses less digits than its factorization.
511020640225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13845 (or 13840 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
The spelling of 511020640225 in words is "five hundred eleven billion, twenty million, six hundred forty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •