Search a number
-
+
10566462131 = 231022344939
BaseRepresentation
bin10011101011100111…
…10110101010110011
31000021101122220002022
421311303312222303
5133120003242011
64504255542055
7522563306021
oct116563665263
930241586068
1010566462131
114532546435
12206a82a92b
13cc5172974
14723499711
1541c9a38db
hex275cf6ab3

10566462131 has 8 divisors (see below), whose sum is σ = 11027197440. Its totient is φ = 10105837192.

The previous prime is 10566462083. The next prime is 10566462139. The reversal of 10566462131 is 13126466501.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10566462131 is a prime.

It is a super-2 number, since 2×105664621312 (a number of 21 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 = 10566462091 and 10566462100.

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

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

Almost surely, 210566462131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 55185.

The product of its (nonzero) digits is 25920, while the sum is 35.

The spelling of 10566462131 in words is "ten billion, five hundred sixty-six million, four hundred sixty-two thousand, one hundred thirty-one".

Divisors: 1 23 10223 44939 235129 1033597 459411397 10566462131