Base | Representation |
---|---|
bin | 1001000110000101101001… |
… | …1011110111110110001001 |
3 | 1022102000021012200021012021 |
4 | 2101201122123313312021 |
5 | 2302320402441334121 |
6 | 33134010131444441 |
7 | 2051330210011336 |
oct | 221413233676611 |
9 | 38360235607167 |
10 | 10000201121161 |
11 | 3206074912359 |
12 | 1156133156721 |
13 | 577026a15c24 |
14 | 268025b2398d |
15 | 1251dc91e641 |
hex | 9185a6f7d89 |
10000201121161 has 2 divisors, whose sum is σ = 10000201121162. Its totient is φ = 10000201121160.
The previous prime is 10000201121159. The next prime is 10000201121173. The reversal of 10000201121161 is 16112110200001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7368814277136 + 2631386844025 = 2714556^2 + 1622155^2 .
It is a cyclic number.
It is not a de Polignac number, because 10000201121161 - 21 = 10000201121159 is a prime.
Together with 10000201121159, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10000201121761) 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, 5000100560580 + 5000100560581.
It is an arithmetic number, because the mean of its divisors is an integer number (5000100560581).
Almost surely, 210000201121161 is an apocalyptic number.
It is an amenable number.
10000201121161 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000201121161 is an equidigital number, since it uses as much as digits as its factorization.
10000201121161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 10000201121161 its reverse (16112110200001), we get a palindrome (26112311321162).
The spelling of 10000201121161 in words is "ten trillion, two hundred one million, one hundred twenty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •