Search a number
-
+
10566665110651 = 13812820393127
BaseRepresentation
bin1001100111000011111001…
…0100100000010001111011
31101102011102001121110210011
42121300332110200101323
52341111012232020101
634250131533002351
72140262545330066
oct231607624402173
941364361543704
1010566665110651
11340432aa89891
121227a829233b7
135b8580844020
142876020a98dd
15134ce34e1751
hex99c3e52047b

10566665110651 has 4 divisors (see below), whose sum is σ = 11379485503792. Its totient is φ = 9753844717512.

The previous prime is 10566665110609. The next prime is 10566665110679. The reversal of 10566665110651 is 15601156666501.

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 10566665110651 - 227 = 10566530892923 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 210566665110651 is an apocalyptic number.

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

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

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

The sum of its prime factors is 812820393140.

The product of its (nonzero) digits is 972000, while the sum is 49.

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

Divisors: 1 13 812820393127 10566665110651