Base | Representation |
---|---|
bin | 1001111110011100110110… |
… | …1101100001001000011111 |
3 | 1102211120121211001111222011 |
4 | 2133213031231201020133 |
5 | 2414201443202040114 |
6 | 35154505520332051 |
7 | 2211306503136136 |
oct | 237471555411037 |
9 | 42746554044864 |
10 | 10968502768159 |
11 | 35497969564a2 |
12 | 1291929474027 |
13 | 61742cac8971 |
14 | 29cc4234891d |
15 | 1404b13d11c4 |
hex | 9f9cdb6121f |
10968502768159 has 2 divisors, whose sum is σ = 10968502768160. Its totient is φ = 10968502768158.
The previous prime is 10968502768127. The next prime is 10968502768187. The reversal of 10968502768159 is 95186720586901.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10968502768159 - 25 = 10968502768127 is a prime.
It is a super-2 number, since 2×109685027681592 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10968502768094 and 10968502768103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10968502708159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5484251384079 + 5484251384080.
It is an arithmetic number, because the mean of its divisors is an integer number (5484251384080).
Almost surely, 210968502768159 is an apocalyptic number.
10968502768159 is a deficient number, since it is larger than the sum of its proper divisors (1).
10968502768159 is an equidigital number, since it uses as much as digits as its factorization.
10968502768159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 65318400, while the sum is 67.
The spelling of 10968502768159 in words is "ten trillion, nine hundred sixty-eight billion, five hundred two million, seven hundred sixty-eight thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •