Search a number
-
+
516064251 = 3298816733
BaseRepresentation
bin11110110000101…
…000001111111011
31022222001210001210
4132300220033323
52024103024001
6123113014203
715534321333
oct3660501773
91288053053
10516064251
1124533978a
121249b4363
1382bbac81
144c7780c3
153048cdd6
hex1ec283fb

516064251 has 16 divisors (see below), whose sum is σ = 712726560. Its totient is φ = 331752960.

The previous prime is 516064243. The next prime is 516064259. The reversal of 516064251 is 152460615.

It is an interprime number because it is at equal distance from previous prime (516064243) and next prime (516064259).

It is not a de Polignac number, because 516064251 - 23 = 516064243 is a prime.

It is a super-2 number, since 2×5160642512 = 532644622320382002, which contains 22 as substring.

It is not an unprimeable number, because it can be changed into a prime (516064259) 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 15 ways as a sum of consecutive naturals, for example, 73281 + ... + 80013.

It is an arithmetic number, because the mean of its divisors is an integer number (44545410).

Almost surely, 2516064251 is an apocalyptic number.

516064251 is a deficient number, since it is larger than the sum of its proper divisors (196662309).

516064251 is a wasteful number, since it uses less digits than its factorization.

516064251 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 7646.

The product of its (nonzero) digits is 7200, while the sum is 30.

The square root of 516064251 is about 22717.0475854588. The cubic root of 516064251 is about 802.1112209274. Note that the first 3 decimals are identical.

The spelling of 516064251 in words is "five hundred sixteen million, sixty-four thousand, two hundred fifty-one".

Divisors: 1 3 29 87 881 2643 6733 20199 25549 76647 195257 585771 5931773 17795319 172021417 516064251