Search a number
-
+
2000105215 = 5479835117
BaseRepresentation
bin111011100110111…
…0010111011111111
312011101112212112221
41313031302323333
513044011331330
6530245110211
7100364420353
oct16715627377
95141485487
102000105215
11937009719
124799b8367
1325b4b3214
1414d8c5463
15ba8d3b7a
hex77372eff

2000105215 has 8 divisors (see below), whose sum is σ = 2405139840. Its totient is φ = 1596741792.

The previous prime is 2000105183. The next prime is 2000105291. The reversal of 2000105215 is 5125010002.

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 2000105215 - 25 = 2000105183 is a prime.

It is a congruent number.

It is an unprimeable number.

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, 415164 + ... + 419953.

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

Almost surely, 22000105215 is an apocalyptic number.

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

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

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

The sum of its prime factors is 835601.

The product of its (nonzero) digits is 100, while the sum is 16.

The square root of 2000105215 is about 44722.5358739864. The cubic root of 2000105215 is about 1259.9431432730.

Adding to 2000105215 its reverse (5125010002), we get a palindrome (7125115217).

The spelling of 2000105215 in words is "two billion, one hundred five thousand, two hundred fifteen".

Divisors: 1 5 479 2395 835117 4175585 400021043 2000105215