Base | Representation |
---|---|
bin | 10100110010000001… |
… | …01001000001101001 |
3 | 1001210112220011122001 |
4 | 22121000221001221 |
5 | 140322144013211 |
6 | 5043033331001 |
7 | 543324035266 |
oct | 123100510151 |
9 | 31715804561 |
10 | 11157016681 |
11 | 4805932848 |
12 | 21b4566a61 |
13 | 108a612225 |
14 | 77baa426d |
15 | 454757ac1 |
hex | 299029069 |
11157016681 has 4 divisors (see below), whose sum is σ = 11157498000. Its totient is φ = 11156535364.
The previous prime is 11157016627. The next prime is 11157016691. The reversal of 11157016681 is 18661075111.
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, and also an emirpimes, since its reverse is a distinct semiprime: 18661075111 = 7 ⋅2665867873.
It is a cyclic number.
It is not a de Polignac number, because 11157016681 - 27 = 11157016553 is a prime.
It is a super-2 number, since 2×111570166812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11157016681.
It is not an unprimeable number, because it can be changed into a prime (11157016601) 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, 204031 + ... + 252868.
It is an arithmetic number, because the mean of its divisors is an integer number (2789374500).
Almost surely, 211157016681 is an apocalyptic number.
It is an amenable number.
11157016681 is a deficient number, since it is larger than the sum of its proper divisors (481319).
11157016681 is an equidigital number, since it uses as much as digits as its factorization.
11157016681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 481318.
The product of its (nonzero) digits is 10080, while the sum is 37.
The spelling of 11157016681 in words is "eleven billion, one hundred fifty-seven million, sixteen thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •