Search a number
-
+
515155516051 = 114091123101963
BaseRepresentation
bin1110111111100011010…
…10010101101010010011
31211020201001222200211211
413133301222111222103
531420014303003201
61032354214320551
752135014431341
oct7376152255223
91736631880754
10515155516051
11189526949a80
1283a10659157
133976ac77657
141ad0dd6a991
15d601416651
hex77f1a95a93

515155516051 has 16 divisors (see below), whose sum is σ = 563869077120. Its totient is φ = 466757565120.

The previous prime is 515155516037. The next prime is 515155516081. The reversal of 515155516051 is 150615551515.

It is a happy number.

It is not a de Polignac number, because 515155516051 - 225 = 515121961619 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 515155515995 and 515155516013.

It is not an unprimeable number, because it can be changed into a prime (515155516081) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5001396 + ... + 5103358.

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

Almost surely, 2515155516051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 103506.

The product of its (nonzero) digits is 93750, while the sum is 40.

The spelling of 515155516051 in words is "five hundred fifteen billion, one hundred fifty-five million, five hundred sixteen thousand, fifty-one".

Divisors: 1 11 409 1123 4499 12353 101963 459307 1121593 5052377 41702867 114504449 458731537 1259548939 46832319641 515155516051