Base | Representation |
---|---|
bin | 10011111010010011… |
… | …01111110111100111 |
3 | 1000120222110002001011 |
4 | 21331021233313213 |
5 | 133343022020314 |
6 | 4524420043051 |
7 | 525620312623 |
oct | 117511576747 |
9 | 30528402034 |
10 | 10689641959 |
11 | 459602a247 |
12 | 20a3b33487 |
13 | 1014841039 |
14 | 7359a2183 |
15 | 4286d64c4 |
hex | 27d26fde7 |
10689641959 has 2 divisors, whose sum is σ = 10689641960. Its totient is φ = 10689641958.
The previous prime is 10689641951. The next prime is 10689642011. The reversal of 10689641959 is 95914698601.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10689641959 - 23 = 10689641951 is a prime.
It is a super-2 number, since 2×106896419592 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10689641951) by changing a digit.
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 as a sum of consecutive naturals, namely, 5344820979 + 5344820980.
It is an arithmetic number, because the mean of its divisors is an integer number (5344820980).
Almost surely, 210689641959 is an apocalyptic number.
10689641959 is a deficient number, since it is larger than the sum of its proper divisors (1).
10689641959 is an equidigital number, since it uses as much as digits as its factorization.
10689641959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4199040, while the sum is 58.
The spelling of 10689641959 in words is "ten billion, six hundred eighty-nine million, six hundred forty-one thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •