Base | Representation |
---|---|
bin | 1001101110101000101010… |
… | …1100001100001111111111 |
3 | 1101212121022001201110212222 |
4 | 2123222022230030033333 |
5 | 2400224014111013414 |
6 | 34430012344515555 |
7 | 2152550363522165 |
oct | 233521254141777 |
9 | 41777261643788 |
10 | 10696795407359 |
11 | 3454538162846 |
12 | 124913b17bbbb |
13 | 5c791b7093a9 |
14 | 28da289b1235 |
15 | 1383ac9e168e |
hex | 9ba8ab0c3ff |
10696795407359 has 4 divisors (see below), whose sum is σ = 10696807444440. Its totient is φ = 10696783370280.
The previous prime is 10696795407323. The next prime is 10696795407367. The reversal of 10696795407359 is 95370459769601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10696795407359 is a prime.
It is a super-2 number, since 2×106967954073592 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10696795407292 and 10696795407301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10696795407959) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4569224 + ... + 6501645.
It is an arithmetic number, because the mean of its divisors is an integer number (2674201861110).
Almost surely, 210696795407359 is an apocalyptic number.
10696795407359 is a deficient number, since it is larger than the sum of its proper divisors (12037081).
10696795407359 is an equidigital number, since it uses as much as digits as its factorization.
10696795407359 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12037080.
The product of its (nonzero) digits is 385786800, while the sum is 71.
The spelling of 10696795407359 in words is "ten trillion, six hundred ninety-six billion, seven hundred ninety-five million, four hundred seven thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •