Search a number
-
+
10005656649 = 312792607677
BaseRepresentation
bin10010101000110001…
…00011010001001001
3221211022102000120220
421110120203101021
5130442422003044
64332503540253
7502643451432
oct112430432111
927738360526
1010005656649
114274a28a2a
121b32a5a689
13c35c1b0c1
146acbd6489
153d8629019
hex254623449

10005656649 has 8 divisors (see below), whose sum is σ = 13351311360. Its totient is φ = 6665219856.

The previous prime is 10005656641. The next prime is 10005656693. The reversal of 10005656649 is 94665650001.

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

It is not a de Polignac number, because 10005656649 - 23 = 10005656641 is a prime.

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

It is a Curzon number.

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

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

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

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

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

Almost surely, 210005656649 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2608959.

The product of its (nonzero) digits is 194400, while the sum is 42.

The spelling of 10005656649 in words is "ten billion, five million, six hundred fifty-six thousand, six hundred forty-nine".

Divisors: 1 3 1279 3837 2607677 7823031 3335218883 10005656649