Search a number
-
+
10561152523 = 91193115811
BaseRepresentation
bin10011101010111111…
…00110011000001011
31000021000200010200011
421311133212120023
5133112123340043
64503550052351
7522500213065
oct116537463013
930230603604
1010561152523
11452a54a229
122068aaa0b7
13cc4033c9c
147228b6735
1541c2a559d
hex2757e660b

10561152523 has 4 divisors (see below), whose sum is σ = 10561359528. Its totient is φ = 10560945520.

The previous prime is 10561152521. The next prime is 10561152577. The reversal of 10561152523 is 32525116501.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 10561152523 - 21 = 10561152521 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33288 + ... + 149098.

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

Almost surely, 210561152523 is an apocalyptic number.

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

10561152523 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 207004.

The product of its (nonzero) digits is 9000, while the sum is 31.

The spelling of 10561152523 in words is "ten billion, five hundred sixty-one million, one hundred fifty-two thousand, five hundred twenty-three".

Divisors: 1 91193 115811 10561152523