Base | Representation |
---|---|
bin | 10100100000100000… |
… | …01100111101111001 |
3 | 1001102022110002100201 |
4 | 22100100030331321 |
5 | 140022041213423 |
6 | 5020304402201 |
7 | 536561213104 |
oct | 122020147571 |
9 | 31368402321 |
10 | 11010101113 |
11 | 473aa07a20 |
12 | 2173316361 |
13 | 106605323b |
14 | 76637d73b |
15 | 4468d72ad |
hex | 29040cf79 |
11010101113 has 4 divisors (see below), whose sum is σ = 12011019408. Its totient is φ = 10009182820.
The previous prime is 11010101101. The next prime is 11010101131. The reversal of 11010101113 is 31110101011.
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: 31110101011 = 11 ⋅2828191001.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11010101113 is a prime.
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 11010101113.
It is not an unprimeable number, because it can be changed into a prime (11010101183) 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, 500459131 + ... + 500459152.
It is an arithmetic number, because the mean of its divisors is an integer number (3002754852).
Almost surely, 211010101113 is an apocalyptic number.
It is an amenable number.
11010101113 is a deficient number, since it is larger than the sum of its proper divisors (1000918295).
11010101113 is a wasteful number, since it uses less digits than its factorization.
11010101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1000918294.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 11010101113 its reverse (31110101011), we get a palindrome (42120202124).
The spelling of 11010101113 in words is "eleven billion, ten million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •