Search a number
-
+
10566081509691 = 313126885703587
BaseRepresentation
bin1001100111000001101110…
…0010001111100100111011
31101102002220101110110202210
42121300123202033210323
52341103313331302231
634245554004230203
72140242230651421
oct231603342174473
941362811413683
1010566081509691
113404060611844
12122793b39b363
135b84b996a806
14287588791111
15134cac162a46
hex99c1b88f93b

10566081509691 has 8 divisors (see below), whose sum is σ = 14195651494464. Its totient is φ = 6990282932360.

The previous prime is 10566081509677. The next prime is 10566081509729. The reversal of 10566081509691 is 19690518066501.

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 10566081509691 - 223 = 10566073121083 is a prime.

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

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

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

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

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

Almost surely, 210566081509691 is an apocalyptic number.

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

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

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

The sum of its prime factors is 26885703721.

The product of its (nonzero) digits is 3499200, while the sum is 57.

The spelling of 10566081509691 in words is "ten trillion, five hundred sixty-six billion, eighty-one million, five hundred nine thousand, six hundred ninety-one".

Divisors: 1 3 131 393 26885703587 80657110761 3522027169897 10566081509691