Base | Representation |
---|---|
bin | 11101000111110010010… |
… | …111100110010011001101 |
3 | 21002022111212220102002122 |
4 | 131013302113212103031 |
5 | 230242002333040401 |
6 | 4131203415502325 |
7 | 264404150612624 |
oct | 35076227462315 |
9 | 7068455812078 |
10 | 2001226065101 |
11 | 701795a3a72a |
12 | 283a266879a5 |
13 | 11693a583793 |
14 | 6cc076466bb |
15 | 370ca96621b |
hex | 1d1f25e64cd |
2001226065101 has 2 divisors, whose sum is σ = 2001226065102. Its totient is φ = 2001226065100.
The previous prime is 2001226065073. The next prime is 2001226065127. The reversal of 2001226065101 is 1015606221002.
It is an a-pointer prime, because the next prime (2001226065127) can be obtained adding 2001226065101 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1172217636100 + 829008429001 = 1082690^2 + 910499^2 .
It is a cyclic number.
It is not a de Polignac number, because 2001226065101 - 222 = 2001221870797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2001226065301) 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, 1000613032550 + 1000613032551.
It is an arithmetic number, because the mean of its divisors is an integer number (1000613032551).
Almost surely, 22001226065101 is an apocalyptic number.
It is an amenable number.
2001226065101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2001226065101 is an equidigital number, since it uses as much as digits as its factorization.
2001226065101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 26.
The spelling of 2001226065101 in words is "two trillion, one billion, two hundred twenty-six million, sixty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •