Base | Representation |
---|---|
bin | 10100100000100111… |
… | …01010111001000001 |
3 | 1001102101011021021101 |
4 | 22100103222321001 |
5 | 140022304310423 |
6 | 5020340054401 |
7 | 536602020205 |
oct | 122023527101 |
9 | 31371137241 |
10 | 11011010113 |
11 | 4740478964 |
12 | 2173694401 |
13 | 10662b0bcc |
14 | 766538b05 |
15 | 446a167ad |
hex | 2904eae41 |
11011010113 has 2 divisors, whose sum is σ = 11011010114. Its totient is φ = 11011010112.
The previous prime is 11011010111. The next prime is 11011010137. The reversal of 11011010113 is 31101011011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10643636224 + 367373889 = 103168^2 + 19167^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011010113 - 21 = 11011010111 is a prime.
Together with 11011010111, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11011010113.
It is not a weakly prime, because it can be changed into another prime (11011010111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505505056 + 5505505057.
It is an arithmetic number, because the mean of its divisors is an integer number (5505505057).
Almost surely, 211011010113 is an apocalyptic number.
It is an amenable number.
11011010113 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011010113 is an equidigital number, since it uses as much as digits as its factorization.
11011010113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 11011010113 its reverse (31101011011), we get a palindrome (42112021124).
The spelling of 11011010113 in words is "eleven billion, eleven million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •