Base | Representation |
---|---|
bin | 11101010000111111000… |
… | …001000000001100110001 |
3 | 21010021000011001221000222 |
4 | 131100333001000030301 |
5 | 230422214043001342 |
6 | 4135515405422425 |
7 | 265203660166622 |
oct | 35207701001461 |
9 | 7107004057028 |
10 | 2011101922097 |
11 | 7059a3673214 |
12 | 285921b6aa15 |
13 | 117852626348 |
14 | 6d4a30d1a49 |
15 | 374a79a0ed2 |
hex | 1d43f040331 |
2011101922097 has 2 divisors, whose sum is σ = 2011101922098. Its totient is φ = 2011101922096.
The previous prime is 2011101922087. The next prime is 2011101922099. The reversal of 2011101922097 is 7902291011102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2005577121856 + 5524800241 = 1416184^2 + 74329^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011101922097 - 26 = 2011101922033 is a prime.
Together with 2011101922099, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (2011101922099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005550961048 + 1005550961049.
It is an arithmetic number, because the mean of its divisors is an integer number (1005550961049).
Almost surely, 22011101922097 is an apocalyptic number.
It is an amenable number.
2011101922097 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011101922097 is an equidigital number, since it uses as much as digits as its factorization.
2011101922097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 35.
Adding to 2011101922097 its reverse (7902291011102), we get a palindrome (9913392933199).
The spelling of 2011101922097 in words is "two trillion, eleven billion, one hundred one million, nine hundred twenty-two thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •