Base | Representation |
---|---|
bin | 10010101110001000… |
… | …100010110010100101 |
3 | 1220212220020002122211 |
4 | 102232020202302211 |
5 | 312131421010141 |
6 | 13122345323421 |
7 | 1311062415454 |
oct | 225610426245 |
9 | 56786202584 |
10 | 20101344421 |
11 | 8585759644 |
12 | 3a8ba96571 |
13 | 1b8469c352 |
14 | d89946b9b |
15 | 7c9ad8d81 |
hex | 4ae222ca5 |
20101344421 has 2 divisors, whose sum is σ = 20101344422. Its totient is φ = 20101344420.
The previous prime is 20101344407. The next prime is 20101344433. The reversal of 20101344421 is 12444310102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16547992321 + 3553352100 = 128639^2 + 59610^2 .
It is a cyclic number.
It is not a de Polignac number, because 20101344421 - 227 = 19967126693 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20101344392 and 20101344401.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20101344401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050672210 + 10050672211.
It is an arithmetic number, because the mean of its divisors is an integer number (10050672211).
Almost surely, 220101344421 is an apocalyptic number.
It is an amenable number.
20101344421 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101344421 is an equidigital number, since it uses as much as digits as its factorization.
20101344421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 20101344421 its reverse (12444310102), we get a palindrome (32545654523).
It can be divided in two parts, 2010 and 1344421, that added together give a palindrome (1346431).
The spelling of 20101344421 in words is "twenty billion, one hundred one million, three hundred forty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •