Base | Representation |
---|---|
bin | 1010000100010000101100… |
… | …0101111100111101001001 |
3 | 1110012010021000211022011012 |
4 | 2201010023011330331021 |
5 | 2422320403102102221 |
6 | 35312414202213305 |
7 | 2221442131522343 |
oct | 241041305747511 |
9 | 43163230738135 |
10 | 11068316831561 |
11 | 3588057334690 |
12 | 12a9144ab4235 |
13 | 623978c36342 |
14 | 2a39d0808293 |
15 | 142da413d65b |
hex | a110b17cf49 |
11068316831561 has 4 divisors (see below), whose sum is σ = 12074527452624. Its totient is φ = 10062106210500.
The previous prime is 11068316831491. The next prime is 11068316831597. The reversal of 11068316831561 is 16513861386011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11068316831561 - 210 = 11068316830537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11068316861561) 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, 503105310515 + ... + 503105310536.
It is an arithmetic number, because the mean of its divisors is an integer number (3018631863156).
Almost surely, 211068316831561 is an apocalyptic number.
11068316831561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11068316831561 is a deficient number, since it is larger than the sum of its proper divisors (1006210621063).
11068316831561 is a wasteful number, since it uses less digits than its factorization.
11068316831561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1006210621062.
The product of its (nonzero) digits is 622080, while the sum is 50.
The spelling of 11068316831561 in words is "eleven trillion, sixty-eight billion, three hundred sixteen million, eight hundred thirty-one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •