Search a number
-
+
10561650413 = 367237712107
BaseRepresentation
bin10011101011000010…
…11111111011101101
31000021001121102122112
421311201133323231
5133112240303123
64504004453405
7522504355466
oct116541377355
930231542575
1010561650413
11452a85a306
1220690aa265
13cc41797b2
147229a5d6d
1541c352d78
hex27585feed

10561650413 has 8 divisors (see below), whose sum is σ = 10595759232. Its totient is φ = 10527571296.

The previous prime is 10561650397. The next prime is 10561650427. The reversal of 10561650413 is 31405616501.

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 10561650413 - 24 = 10561650397 is a prime.

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

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 10561650413.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 866306 + ... + 878412.

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

Almost surely, 210561650413 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 14851.

The product of its (nonzero) digits is 10800, while the sum is 32.

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

Divisors: 1 367 2377 12107 872359 4443269 28778339 10561650413