Base | Representation |
---|---|
bin | 10100101101101110… |
… | …10011000100011101 |
3 | 1001201001010222220011 |
4 | 22112313103010131 |
5 | 140233434404041 |
6 | 5035305523221 |
7 | 542406023326 |
oct | 122667230435 |
9 | 31631128804 |
10 | 11121013021 |
11 | 4797581758 |
12 | 21a44a3511 |
13 | 10830176a1 |
14 | 776db144d |
15 | 4514e4e81 |
hex | 296dd311d |
11121013021 has 2 divisors, whose sum is σ = 11121013022. Its totient is φ = 11121013020.
The previous prime is 11121013019. The next prime is 11121013031. The reversal of 11121013021 is 12031012111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10813712121 + 307300900 = 103989^2 + 17530^2 .
It is a cyclic number.
It is not a de Polignac number, because 11121013021 - 21 = 11121013019 is a prime.
It is a super-2 number, since 2×111210130212 (a number of 21 digits) contains 22 as substring.
Together with 11121013019, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 11121012992 and 11121013010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11121013031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560506510 + 5560506511.
It is an arithmetic number, because the mean of its divisors is an integer number (5560506511).
Almost surely, 211121013021 is an apocalyptic number.
It is an amenable number.
11121013021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11121013021 is an equidigital number, since it uses as much as digits as its factorization.
11121013021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11121013021 its reverse (12031012111), we get a palindrome (23152025132).
The spelling of 11121013021 in words is "eleven billion, one hundred twenty-one million, thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •