Base | Representation |
---|---|
bin | 11110110011000… |
… | …000110001000001 |
3 | 1100000020112000012 |
4 | 132303000301001 |
5 | 2024233021321 |
6 | 123134234305 |
7 | 15542532545 |
oct | 3663006101 |
9 | 1300215005 |
10 | 516688961 |
11 | 245726078 |
12 | 125055995 |
13 | 83079419 |
14 | 4c89ba25 |
15 | 3056305b |
hex | 1ecc0c41 |
516688961 has 4 divisors (see below), whose sum is σ = 517319124. Its totient is φ = 516058800.
The previous prime is 516688943. The next prime is 516688999. The reversal of 516688961 is 169886615.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 169886615 = 5 ⋅33977323.
It can be written as a sum of positive squares in 2 ways, for example, as 301890625 + 214798336 = 17375^2 + 14656^2 .
It is a cyclic number.
It is not a de Polignac number, because 516688961 - 26 = 516688897 is a prime.
It is a super-3 number, since 3×5166889613 (a number of 27 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (516682961) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 313850 + ... + 315491.
It is an arithmetic number, because the mean of its divisors is an integer number (129329781).
Almost surely, 2516688961 is an apocalyptic number.
It is an amenable number.
516688961 is a deficient number, since it is larger than the sum of its proper divisors (630163).
516688961 is an equidigital number, since it uses as much as digits as its factorization.
516688961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 630162.
The product of its digits is 622080, while the sum is 50.
The square root of 516688961 is about 22730.7932329692. The cubic root of 516688961 is about 802.4347496628.
The spelling of 516688961 in words is "five hundred sixteen million, six hundred eighty-eight thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •