Search a number
-
+
10561600551 = 326313386059
BaseRepresentation
bin10011101011000010…
…10011110000100111
31000021001111220020210
421311201103300213
5133112232204201
64504003430503
7522504060225
oct116541236047
930231456223
1010561600551
11452a8258a7
122069085433
13cc415cba8
14722991b15
1541c3431d6
hex275853c27

10561600551 has 8 divisors (see below), whose sum is σ = 14135679360. Its totient is φ = 7014294392.

The previous prime is 10561600499. The next prime is 10561600579. The reversal of 10561600551 is 15500616501.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 10561600551 - 26 = 10561600487 is a prime.

It is a super-2 number, since 2×105616005512 (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 (10561620551) 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 7 ways as a sum of consecutive naturals, for example, 6692241 + ... + 6693818.

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

Almost surely, 210561600551 is an apocalyptic number.

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

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

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

The sum of its prime factors is 13386325.

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

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

Divisors: 1 3 263 789 13386059 40158177 3520533517 10561600551