Base | Representation |
---|---|
bin | 11110110001011… |
… | …011000111110111 |
3 | 1022222110100220120 |
4 | 132301123013313 |
5 | 2024131211011 |
6 | 123121303023 |
7 | 15536150010 |
oct | 3661330767 |
9 | 1288410816 |
10 | 516272631 |
11 | 2454712a6 |
12 | 124a94a73 |
13 | 82c61a84 |
14 | 4c7d0007 |
15 | 304cea06 |
hex | 1ec5b1f7 |
516272631 has 16 divisors (see below), whose sum is σ = 788736000. Its totient is φ = 294249888.
The previous prime is 516272623. The next prime is 516272639. The reversal of 516272631 is 136272615.
It is an interprime number because it is at equal distance from previous prime (516272623) and next prime (516272639).
It is not a de Polignac number, because 516272631 - 23 = 516272623 is a prime.
It is a super-2 number, since 2×5162726312 = 533074859039324322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 516272592 and 516272601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (516272639) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23431 + ... + 39768.
It is an arithmetic number, because the mean of its divisors is an integer number (49296000).
Almost surely, 2516272631 is an apocalyptic number.
516272631 is a deficient number, since it is larger than the sum of its proper divisors (272463369).
516272631 is a wasteful number, since it uses less digits than its factorization.
516272631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63598.
The product of its digits is 15120, while the sum is 33.
The square root of 516272631 is about 22721.6335460283. The cubic root of 516272631 is about 802.2191670756.
The spelling of 516272631 in words is "five hundred sixteen million, two hundred seventy-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •