Search a number
-
+
10561511151 = 322351021793
BaseRepresentation
bin10011101011000001…
…11101111011101111
31000021001100100121200
421311200331323233
5133112221324101
64504001500543
7522503235462
oct116540757357
930231310550
1010561511151
11452a774714
122069041753
13cc412b2a9
1472296b2d9
1541c326986
hex27583deef

10561511151 has 12 divisors (see below), whose sum is σ = 15918799728. Its totient is φ = 6734876544.

The previous prime is 10561511143. The next prime is 10561511159. The reversal of 10561511151 is 15111516501.

10561511151 is a `hidden beast` number, since 1 + 0 + 561 + 51 + 1 + 1 + 51 = 666.

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

It is not a de Polignac number, because 10561511151 - 23 = 10561511143 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25510690 + ... + 25511103.

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

Almost surely, 210561511151 is an apocalyptic number.

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

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

10561511151 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 51021822 (or 51021819 counting only the distinct ones).

The product of its (nonzero) digits is 750, while the sum is 27.

The spelling of 10561511151 in words is "ten billion, five hundred sixty-one million, five hundred eleven thousand, one hundred fifty-one".

Divisors: 1 3 9 23 69 207 51021793 153065379 459196137 1173501239 3520503717 10561511151