Base | Representation |
---|---|
bin | 1001001001000001000010… |
… | …00010010110110010100001 |
3 | 2122011122012100001122020212 |
4 | 10210200201002112302201 |
5 | 10113313322302223131 |
6 | 110430134504343505 |
7 | 4143151356114002 |
oct | 444404102266241 |
9 | 78148170048225 |
10 | 20101001211041 |
11 | 644a872173883 |
12 | 2307860774b95 |
13 | b2a69336593a |
14 | 4d6c722631a9 |
15 | 24cd16e40a2b |
hex | 124821096ca1 |
20101001211041 has 2 divisors, whose sum is σ = 20101001211042. Its totient is φ = 20101001211040.
The previous prime is 20101001210957. The next prime is 20101001211043. The reversal of 20101001211041 is 14011210010102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12599099329441 + 7501901881600 = 3549521^2 + 2738960^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20101001211041 is a prime.
It is a Sophie Germain prime.
Together with 20101001211043, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (20101001211043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050500605520 + 10050500605521.
It is an arithmetic number, because the mean of its divisors is an integer number (10050500605521).
Almost surely, 220101001211041 is an apocalyptic number.
It is an amenable number.
20101001211041 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101001211041 is an equidigital number, since it uses as much as digits as its factorization.
20101001211041 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 14.
Adding to 20101001211041 its reverse (14011210010102), we get a palindrome (34112211221143).
The spelling of 20101001211041 in words is "twenty trillion, one hundred one billion, one million, two hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •