Base | Representation |
---|---|
bin | 10100000011011110… |
… | …01000011010111001 |
3 | 1000210100011110000112 |
4 | 22001233020122321 |
5 | 134022214110323 |
6 | 4540204314105 |
7 | 530543112452 |
oct | 120157103271 |
9 | 30710143015 |
10 | 10766550713 |
11 | 46254899a6 |
12 | 2105842935 |
13 | 102775b389 |
14 | 741ca2129 |
15 | 430329178 |
hex | 281bc86b9 |
10766550713 has 4 divisors (see below), whose sum is σ = 10778042100. Its totient is φ = 10755059328.
The previous prime is 10766550703. The next prime is 10766550727. The reversal of 10766550713 is 31705566701.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31705566701 = 1319 ⋅24037579.
It can be written as a sum of positive squares in 2 ways, for example, as 5812080169 + 4954470544 = 76237^2 + 70388^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10766550713 is a prime.
It is a super-2 number, since 2×107665507132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10766550703) 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, 5744288 + ... + 5746161.
It is an arithmetic number, because the mean of its divisors is an integer number (2694510525).
Almost surely, 210766550713 is an apocalyptic number.
It is an amenable number.
10766550713 is a deficient number, since it is larger than the sum of its proper divisors (11491387).
10766550713 is an equidigital number, since it uses as much as digits as its factorization.
10766550713 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11491386.
The product of its (nonzero) digits is 132300, while the sum is 41.
The spelling of 10766550713 in words is "ten billion, seven hundred sixty-six million, five hundred fifty thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •