Base | Representation |
---|---|
bin | 10100100001110011… |
… | …10100110010010001 |
3 | 1001110001222102102211 |
4 | 22100321310302101 |
5 | 140032334341423 |
6 | 5021334312121 |
7 | 540053025436 |
oct | 122071646221 |
9 | 31401872384 |
10 | 11021012113 |
11 | 474608a581 |
12 | 2176ab8641 |
13 | 10683a3657 |
14 | 7679bdb8d |
15 | 44784010d |
hex | 290e74c91 |
11021012113 has 2 divisors, whose sum is σ = 11021012114. Its totient is φ = 11021012112.
The previous prime is 11021012087. The next prime is 11021012131. The reversal of 11021012113 is 31121012011.
It is a happy number.
Together with next prime (11021012131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10736482689 + 284529424 = 103617^2 + 16868^2 .
It is an emirp because it is prime and its reverse (31121012011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11021012113 - 225 = 10987457681 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11021012093 and 11021012102.
It is not a weakly prime, because it can be changed into another prime (11021010113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510506056 + 5510506057.
It is an arithmetic number, because the mean of its divisors is an integer number (5510506057).
Almost surely, 211021012113 is an apocalyptic number.
It is an amenable number.
11021012113 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021012113 is an equidigital number, since it uses as much as digits as its factorization.
11021012113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11021012113 its reverse (31121012011), we get a palindrome (42142024124).
The spelling of 11021012113 in words is "eleven billion, twenty-one million, twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •