Base | Representation |
---|---|
bin | 1001001001000001001101… |
… | …11111110111010100101001 |
3 | 2122011122110022020200100101 |
4 | 10210200212333313110221 |
5 | 10113314023403034121 |
6 | 110430152440105401 |
7 | 4143154012150462 |
oct | 444404677672451 |
9 | 78148408220311 |
10 | 20101101221161 |
11 | 644a913671974 |
12 | 230788a165261 |
13 | b2a6aacb0c1c |
14 | 4d6c81657d69 |
15 | 24cd20ae8491 |
hex | 124826ff7529 |
20101101221161 has 2 divisors, whose sum is σ = 20101101221162. Its totient is φ = 20101101221160.
The previous prime is 20101101221119. The next prime is 20101101221251. The reversal of 20101101221161 is 16112210110102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18007419555225 + 2093681665936 = 4243515^2 + 1446956^2 .
It is a cyclic number.
It is not a de Polignac number, because 20101101221161 - 221 = 20101099124009 is a prime.
It is not a weakly prime, because it can be changed into another prime (20101101231161) 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, 10050550610580 + 10050550610581.
It is an arithmetic number, because the mean of its divisors is an integer number (10050550610581).
Almost surely, 220101101221161 is an apocalyptic number.
It is an amenable number.
20101101221161 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101101221161 is an equidigital number, since it uses as much as digits as its factorization.
20101101221161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 20101101221161 its reverse (16112210110102), we get a palindrome (36213311331263).
The spelling of 20101101221161 in words is "twenty trillion, one hundred one billion, one hundred one million, two hundred twenty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •