Base | Representation |
---|---|
bin | 10011111100001101… |
… | …00011001011110101 |
3 | 1000122002102212000012 |
4 | 21332012203023311 |
5 | 133411112041124 |
6 | 4530145430005 |
7 | 526202635541 |
oct | 117606431365 |
9 | 30562385005 |
10 | 10705580789 |
11 | 45a4026332 |
12 | 20a933b305 |
13 | 1017c31ab7 |
14 | 737b50a21 |
15 | 429cd3e0e |
hex | 27e1a32f5 |
10705580789 has 8 divisors (see below), whose sum is σ = 10814380632. Its totient is φ = 10597027840.
The previous prime is 10705580747. The next prime is 10705580791. The reversal of 10705580789 is 98708550701.
It can be written as a sum of positive squares in 4 ways, for example, as 574564 + 10705006225 = 758^2 + 103465^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10705580789 is a prime.
It is a super-2 number, since 2×107055807892 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10705580719) 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 7 ways as a sum of consecutive naturals, for example, 26069 + ... + 148629.
It is an arithmetic number, because the mean of its divisors is an integer number (1351797579).
Almost surely, 210705580789 is an apocalyptic number.
It is an amenable number.
10705580789 is a deficient number, since it is larger than the sum of its proper divisors (108799843).
10705580789 is a wasteful number, since it uses less digits than its factorization.
10705580789 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123447.
The product of its (nonzero) digits is 705600, while the sum is 50.
The spelling of 10705580789 in words is "ten billion, seven hundred five million, five hundred eighty thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •