Base | Representation |
---|---|
bin | 10000001011101001100… |
… | …111100000101001001101 |
3 | 10221022022122201101210011 |
4 | 100023221213200221031 |
5 | 121204404334323041 |
6 | 2210504433313221 |
7 | 143224626430624 |
oct | 20135147405115 |
9 | 3838278641704 |
10 | 1112021011021 |
11 | 399672963548 |
12 | 15b625705811 |
13 | 80b2b3b844b |
14 | 3bb71bd46bb |
15 | 1ddd5ec1e81 |
hex | 102e99e0a4d |
1112021011021 has 2 divisors, whose sum is σ = 1112021011022. Its totient is φ = 1112021011020.
The previous prime is 1112021011019. The next prime is 1112021011043. The reversal of 1112021011021 is 1201101202111.
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., 747730301796 + 364290709225 = 864714^2 + 603565^2 .
It is a cyclic number.
It is not a de Polignac number, because 1112021011021 - 21 = 1112021011019 is a prime.
Together with 1112021011019, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1112021010992 and 1112021011010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112021011051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556010505510 + 556010505511.
It is an arithmetic number, because the mean of its divisors is an integer number (556010505511).
Almost surely, 21112021011021 is an apocalyptic number.
It is an amenable number.
1112021011021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112021011021 is an equidigital number, since it uses as much as digits as its factorization.
1112021011021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1112021011021 its reverse (1201101202111), we get a palindrome (2313122213132).
The spelling of 1112021011021 in words is "one trillion, one hundred twelve billion, twenty-one million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •