Base | Representation |
---|---|
bin | 1001100011101000001011… |
… | …0111000101110111110101 |
3 | 1101012112011200001002222002 |
4 | 2120322002313011313311 |
5 | 2334124214441023234 |
6 | 34203055234545045 |
7 | 2133104145644612 |
oct | 230720267056765 |
9 | 41175150032862 |
10 | 10507685486069 |
11 | 33913145819a2 |
12 | 1218562738185 |
13 | 5b2b41609295 |
14 | 284808d49509 |
15 | 1334e064727e |
hex | 98e82dc5df5 |
10507685486069 has 2 divisors, whose sum is σ = 10507685486070. Its totient is φ = 10507685486068.
The previous prime is 10507685486027. The next prime is 10507685486099. The reversal of 10507685486069 is 96068458670501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8597034484900 + 1910651001169 = 2932070^2 + 1382263^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10507685486069 is a prime.
It is a super-2 number, since 2×105076854860692 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10507685485996 and 10507685486014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10507685486099) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5253842743034 + 5253842743035.
It is an arithmetic number, because the mean of its divisors is an integer number (5253842743035).
Almost surely, 210507685486069 is an apocalyptic number.
It is an amenable number.
10507685486069 is a deficient number, since it is larger than the sum of its proper divisors (1).
10507685486069 is an equidigital number, since it uses as much as digits as its factorization.
10507685486069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 87091200, while the sum is 65.
The spelling of 10507685486069 in words is "ten trillion, five hundred seven billion, six hundred eighty-five million, four hundred eighty-six thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •