Search a number
-
+
10005660670 = 251000566067
BaseRepresentation
bin10010101000110001…
…00100001111111110
3221211022102020002211
421110120210033332
5130442422120140
64332504011034
7502643466235
oct112430441776
927738366084
1010005660670
114274a30a55
121b32a60a7a
13c35c1cb95
146acbd7b1c
153d862a2ea
hex2546243fe

10005660670 has 8 divisors (see below), whose sum is σ = 18010189224. Its totient is φ = 4002264264.

The previous prime is 10005660569. The next prime is 10005660689. The reversal of 10005660670 is 7606650001.

10005660670 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

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

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 210005660670 is an apocalyptic number.

10005660670 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 1000566074.

The product of its (nonzero) digits is 7560, while the sum is 31.

The spelling of 10005660670 in words is "ten billion, five million, six hundred sixty thousand, six hundred seventy".

Divisors: 1 2 5 10 1000566067 2001132134 5002830335 10005660670