Base | Representation |
---|---|
bin | 10011111011101111… |
… | …10000110011000001 |
3 | 1000121211010220120200 |
4 | 21331313300303001 |
5 | 133404114020020 |
6 | 4525530355413 |
7 | 526124662221 |
oct | 117567606301 |
9 | 30554126520 |
10 | 10701704385 |
11 | 45a1918999 |
12 | 20a7b8bb69 |
13 | 10171a5578 |
14 | 737422081 |
15 | 4297ba590 |
hex | 27ddf0cc1 |
10701704385 has 36 divisors (see below), whose sum is σ = 19391234772. Its totient is φ = 5459408064.
The previous prime is 10701704383. The next prime is 10701704389. The reversal of 10701704385 is 58340710701.
10701704385 is a `hidden beast` number, since 107 + 0 + 170 + 4 + 385 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 3661823169 + 7039881216 = 60513^2 + 83904^2 .
It is not a de Polignac number, because 10701704385 - 21 = 10701704383 is a prime.
It is a super-2 number, since 2×107017043852 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10701704383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 200974 + ... + 248583.
Almost surely, 210701704385 is an apocalyptic number.
10701704385 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10701704385 is a deficient number, since it is larger than the sum of its proper divisors (8689530387).
10701704385 is a wasteful number, since it uses less digits than its factorization.
10701704385 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 449614 (or 449588 counting only the distinct ones).
The product of its (nonzero) digits is 23520, while the sum is 36.
The spelling of 10701704385 in words is "ten billion, seven hundred one million, seven hundred four thousand, three hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •