Base | Representation |
---|---|
bin | 10011100000010011… |
… | …10101010111110001 |
3 | 1000000210002101210002 |
4 | 21300021311113301 |
5 | 132421204420224 |
6 | 4451025515345 |
7 | 520331540312 |
oct | 116011652761 |
9 | 30023071702 |
10 | 10471560689 |
11 | 4493a17597 |
12 | 2042aa2b55 |
13 | cab5c5a75 |
14 | 714a34609 |
15 | 4144a99ae |
hex | 2702755f1 |
10471560689 has 2 divisors, whose sum is σ = 10471560690. Its totient is φ = 10471560688.
The previous prime is 10471560667. The next prime is 10471560707. The reversal of 10471560689 is 98606517401.
10471560689 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8534064400 + 1937496289 = 92380^2 + 44017^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10471560689 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (10471560629) by changing a digit.
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 as a sum of consecutive naturals, namely, 5235780344 + 5235780345.
It is an arithmetic number, because the mean of its divisors is an integer number (5235780345).
Almost surely, 210471560689 is an apocalyptic number.
It is an amenable number.
10471560689 is a deficient number, since it is larger than the sum of its proper divisors (1).
10471560689 is an equidigital number, since it uses as much as digits as its factorization.
10471560689 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 47.
The spelling of 10471560689 in words is "ten billion, four hundred seventy-one million, five hundred sixty thousand, six hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •