Search a number
-
+
11606412641 = 82314102567
BaseRepresentation
bin10101100111100101…
…11100110101100001
31002221212111211222212
422303302330311201
5142232220201031
65155405411505
7560421610505
oct126362746541
932855454885
1011606412641
114a1657666a
1222bab69b95
13112c759cb5
147c1646305
1547de2712b
hex2b3cbcd61

11606412641 has 4 divisors (see below), whose sum is σ = 11620516032. Its totient is φ = 11592309252.

The previous prime is 11606412619. The next prime is 11606412647. The reversal of 11606412641 is 14621460611.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 11606412641 - 26 = 11606412577 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 11606412598 and 11606412607.

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

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

Almost surely, 211606412641 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 14103390.

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

The spelling of 11606412641 in words is "eleven billion, six hundred six million, four hundred twelve thousand, six hundred forty-one".

Divisors: 1 823 14102567 11606412641