Base | Representation |
---|---|
bin | 11110011101110… |
… | …110101001000111 |
3 | 1022121210201122122 |
4 | 132131312221013 |
5 | 2021323024341 |
6 | 122415320155 |
7 | 15444432200 |
oct | 3635665107 |
9 | 1277721578 |
10 | 511142471 |
11 | 2425879a4 |
12 | 12322005b |
13 | 81b86988 |
14 | 4bc565a7 |
15 | 2ed1994b |
hex | 1e776a47 |
511142471 has 6 divisors (see below), whose sum is σ = 594594360. Its totient is φ = 438122076.
The previous prime is 511142461. The next prime is 511142473. The reversal of 511142471 is 174241115.
It is not a de Polignac number, because 511142471 - 210 = 511141447 is a prime.
It is a super-3 number, since 3×5111424713 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 511142471.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (511142473) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5215691 + ... + 5215788.
It is an arithmetic number, because the mean of its divisors is an integer number (99099060).
Almost surely, 2511142471 is an apocalyptic number.
511142471 is a deficient number, since it is larger than the sum of its proper divisors (83451889).
511142471 is a wasteful number, since it uses less digits than its factorization.
511142471 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10431493 (or 10431486 counting only the distinct ones).
The product of its digits is 1120, while the sum is 26.
The square root of 511142471 is about 22608.4601642836. The cubic root of 511142471 is about 799.5531207326.
Adding to 511142471 its reverse (174241115), we get a palindrome (685383586).
The spelling of 511142471 in words is "five hundred eleven million, one hundred forty-two thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •