Base | Representation |
---|---|
bin | 1001001001101000010111… |
… | …10100100100000000010101 |
3 | 2122020122201010222212110112 |
4 | 10210310023310210000111 |
5 | 10114140100222010401 |
6 | 110443550243532405 |
7 | 4144526615566202 |
oct | 444641364440025 |
9 | 78218633885415 |
10 | 20122120110101 |
11 | 645881a246269 |
12 | 230b97538a105 |
13 | b2c67a7aa509 |
14 | 4d7cb6da6ca9 |
15 | 24d6510273bb |
hex | 124d0bd24015 |
20122120110101 has 2 divisors, whose sum is σ = 20122120110102. Its totient is φ = 20122120110100.
The previous prime is 20122120110073. The next prime is 20122120110149. The reversal of 20122120110101 is 10101102122102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12078509422225 + 8043610687876 = 3475415^2 + 2836126^2 .
It is a cyclic number.
It is not a de Polignac number, because 20122120110101 - 242 = 15724073598997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20122120100101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10061060055050 + 10061060055051.
It is an arithmetic number, because the mean of its divisors is an integer number (10061060055051).
Almost surely, 220122120110101 is an apocalyptic number.
It is an amenable number.
20122120110101 is a deficient number, since it is larger than the sum of its proper divisors (1).
20122120110101 is an equidigital number, since it uses as much as digits as its factorization.
20122120110101 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 20122120110101 its reverse (10101102122102), we get a palindrome (30223222232203).
The spelling of 20122120110101 in words is "twenty trillion, one hundred twenty-two billion, one hundred twenty million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •