Base | Representation |
---|---|
bin | 10000001011101001100… |
… | …111100010110101110101 |
3 | 10221022022122201212010111 |
4 | 100023221213202311311 |
5 | 121204404340120041 |
6 | 2210504433423021 |
7 | 143224626466102 |
oct | 20135147426565 |
9 | 3838278655114 |
10 | 1112021020021 |
11 | 39967296a28a |
12 | 15b62570aa71 |
13 | 80b2b3bc582 |
14 | 3bb71bd7aa9 |
15 | 1ddd5ec4981 |
hex | 102e99e2d75 |
1112021020021 has 2 divisors, whose sum is σ = 1112021020022. Its totient is φ = 1112021020020.
The previous prime is 1112021020013. The next prime is 1112021020027. The reversal of 1112021020021 is 1200201202111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 991788924996 + 120232095025 = 995886^2 + 346745^2 .
It is an emirp because it is prime and its reverse (1200201202111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1112021020021 - 23 = 1112021020013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1112021019983 and 1112021020010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112021020027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556010510010 + 556010510011.
It is an arithmetic number, because the mean of its divisors is an integer number (556010510011).
Almost surely, 21112021020021 is an apocalyptic number.
It is an amenable number.
1112021020021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112021020021 is an equidigital number, since it uses as much as digits as its factorization.
1112021020021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1112021020021 its reverse (1200201202111), we get a palindrome (2312222222132).
The spelling of 1112021020021 in words is "one trillion, one hundred twelve billion, twenty-one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •