Base | Representation |
---|---|
bin | 11110100100111001010… |
… | …101101101101010001101 |
3 | 21102212120022101101000001 |
4 | 132210321111231222031 |
5 | 233411224424013401 |
6 | 4245140045404301 |
7 | 304543501551346 |
oct | 36447125555215 |
9 | 7385508341001 |
10 | 2101201001101 |
11 | 740129206884 |
12 | 29b287b69691 |
13 | 1231b0b28b47 |
14 | 739ad2210cd |
15 | 399cc89e601 |
hex | 1e93956da8d |
2101201001101 has 2 divisors, whose sum is σ = 2101201001102. Its totient is φ = 2101201001100.
The previous prime is 2101201001099. The next prime is 2101201001117. The reversal of 2101201001101 is 1011001021012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1356689152900 + 744511848201 = 1164770^2 + 862851^2 .
It is a cyclic number.
It is not a de Polignac number, because 2101201001101 - 21 = 2101201001099 is a prime.
Together with 2101201001099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2101201001131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050600500550 + 1050600500551.
It is an arithmetic number, because the mean of its divisors is an integer number (1050600500551).
Almost surely, 22101201001101 is an apocalyptic number.
It is an amenable number.
2101201001101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101201001101 is an equidigital number, since it uses as much as digits as its factorization.
2101201001101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 2101201001101 its reverse (1011001021012), we get a palindrome (3112202022113).
The spelling of 2101201001101 in words is "two trillion, one hundred one billion, two hundred one million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •