Search a number
-
+
15116064261 = 359178947737
BaseRepresentation
bin11100001001111110…
…01101011000000101
31110000110112121220220
432010333031120011
5221424203024021
610535541414553
71043406266124
oct160477153005
943013477826
1015116064261
1164576958a1
122b1a40a459
13156b8c572c
14a357d7abb
155d70ddcc6
hex384fcd605

15116064261 has 16 divisors (see below), whose sum is σ = 20508244800. Its totient is φ = 9900828288.

The previous prime is 15116064221. The next prime is 15116064277. The reversal of 15116064261 is 16246061151.

15116064261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 15116064261 - 27 = 15116064133 is a prime.

It is a super-2 number, since 2×151160642612 (a number of 21 digits) contains 22 as substring.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (15116064221) 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, 292785 + ... + 340521.

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

Almost surely, 215116064261 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 49588.

The product of its (nonzero) digits is 8640, while the sum is 33.

The spelling of 15116064261 in words is "fifteen billion, one hundred sixteen million, sixty-four thousand, two hundred sixty-one".

Divisors: 1 3 59 177 1789 5367 47737 105551 143211 316653 2816483 8449449 85401493 256204479 5038688087 15116064261