Search a number
-
+
1000130705 = 57157918097
BaseRepresentation
bin111011100111001…
…100100010010001
32120200220220101222
4323213030202101
54022013140310
6243124134425
733532653650
oct7347144221
92520826358
101000130705
11473603002
1223ab37415
1312c284822
1496b83197
155cc0a055
hex3b9cc891

1000130705 has 16 divisors (see below), whose sum is σ = 1372552320. Its totient is φ = 685331712.

The previous prime is 1000130669. The next prime is 1000130717. The reversal of 1000130705 is 5070310001.

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

It is a cyclic number.

It is not a de Polignac number, because 1000130705 - 28 = 1000130449 is a prime.

It is a super-2 number, since 2×10001307052 = 2000522854167594050, which contains 22 as substring.

It is a Curzon number.

It is an unprimeable number.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 46217 + ... + 64313.

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

Almost surely, 21000130705 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 19688.

The product of its (nonzero) digits is 105, while the sum is 17.

The square root of 1000130705 is about 31624.8431616664. The cubic root of 1000130705 is about 1000.0435664353.

Adding to 1000130705 its reverse (5070310001), we get a palindrome (6070440706).

The spelling of 1000130705 in words is "one billion, one hundred thirty thousand, seven hundred five".

Divisors: 1 5 7 35 1579 7895 11053 18097 55265 90485 126679 633395 28575163 142875815 200026141 1000130705