Base | Representation |
---|---|
bin | 11110110010101… |
… | …100110110100101 |
3 | 1100000002101010022 |
4 | 132302230312211 |
5 | 2024222414042 |
6 | 123132404525 |
7 | 15542043005 |
oct | 3662546645 |
9 | 1300071108 |
10 | 516607397 |
11 | 24567a869 |
12 | 125016745 |
13 | 8304b267 |
14 | 4c87a005 |
15 | 30548cd2 |
hex | 1ecacda5 |
516607397 has 4 divisors (see below), whose sum is σ = 543797280. Its totient is φ = 489417516.
The previous prime is 516607379. The next prime is 516607417. The reversal of 516607397 is 793706615.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 516607397 - 218 = 516345253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (516607697) 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 3 ways as a sum of consecutive naturals, for example, 13594913 + ... + 13594950.
It is an arithmetic number, because the mean of its divisors is an integer number (135949320).
Almost surely, 2516607397 is an apocalyptic number.
It is an amenable number.
516607397 is a deficient number, since it is larger than the sum of its proper divisors (27189883).
516607397 is a wasteful number, since it uses less digits than its factorization.
516607397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27189882.
The product of its (nonzero) digits is 238140, while the sum is 44.
The square root of 516607397 is about 22728.9990320735. Note that the first 3 decimals coincide. The cubic root of 516607397 is about 802.3925235931.
Adding to 516607397 its sum of digits (44), we get a square (516607441 = 227292).
The spelling of 516607397 in words is "five hundred sixteen million, six hundred seven thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •