Base | Representation |
---|---|
bin | 11101010000111001000… |
… | …100101111111111111101 |
3 | 21010020202012111121022021 |
4 | 131100321010233333331 |
5 | 230422013033203041 |
6 | 4135501445120141 |
7 | 265201340003344 |
oct | 35207104577775 |
9 | 7106665447267 |
10 | 2011002241021 |
11 | 70595237a364 |
12 | 2858b46b9051 |
13 | 117837a94a67 |
14 | 6d493b84b5b |
15 | 3749dd60cd1 |
hex | 1d43912fffd |
2011002241021 has 2 divisors, whose sum is σ = 2011002241022. Its totient is φ = 2011002241020.
The previous prime is 2011002241019. The next prime is 2011002241069. The reversal of 2011002241021 is 1201422001102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1992868656100 + 18133584921 = 1411690^2 + 134661^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011002241021 - 21 = 2011002241019 is a prime.
Together with 2011002241019, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2011002240986 and 2011002241004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011002241091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005501120510 + 1005501120511.
It is an arithmetic number, because the mean of its divisors is an integer number (1005501120511).
Almost surely, 22011002241021 is an apocalyptic number.
It is an amenable number.
2011002241021 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011002241021 is an equidigital number, since it uses as much as digits as its factorization.
2011002241021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2011002241021 its reverse (1201422001102), we get a palindrome (3212424242123).
The spelling of 2011002241021 in words is "two trillion, eleven billion, two million, two hundred forty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •