Base | Representation |
---|---|
bin | 10100101011010101… |
… | …11111110101110001 |
3 | 1001122122111210201011 |
4 | 22111222333311301 |
5 | 140213324330223 |
6 | 5033313110521 |
7 | 542044016320 |
oct | 122552776561 |
9 | 31578453634 |
10 | 11101011313 |
11 | 4787260117 |
12 | 2199858441 |
13 | 107bb33562 |
14 | 7744860b7 |
15 | 44e89380d |
hex | 295abfd71 |
11101011313 has 4 divisors (see below), whose sum is σ = 12686870080. Its totient is φ = 9515152548.
The previous prime is 11101011301. The next prime is 11101011319. The reversal of 11101011313 is 31311010111.
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: 31311010111 = 2459 ⋅12733229.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11101011313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11101011293 and 11101011302.
It is not an unprimeable number, because it can be changed into a prime (11101011319) 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, 792929373 + ... + 792929386.
It is an arithmetic number, because the mean of its divisors is an integer number (3171717520).
Almost surely, 211101011313 is an apocalyptic number.
It is an amenable number.
11101011313 is a deficient number, since it is larger than the sum of its proper divisors (1585858767).
11101011313 is an equidigital number, since it uses as much as digits as its factorization.
11101011313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1585858766.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 11101011313 its reverse (31311010111), we get a palindrome (42412021424).
The spelling of 11101011313 in words is "eleven billion, one hundred one million, eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •