Base | Representation |
---|---|
bin | 1001010010001010101110… |
… | …01000100100011011100101 |
3 | 2200021200211012210101120001 |
4 | 10221011113020210123211 |
5 | 10133441311001001203 |
6 | 111230420241341301 |
7 | 4204652445604036 |
oct | 451052710443345 |
9 | 80250735711501 |
10 | 20415441422053 |
11 | 656115a4a9367 |
12 | 2358796037831 |
13 | b51224a535b2 |
14 | 50818110ca8d |
15 | 2560bc1da91d |
hex | 1291572246e5 |
20415441422053 has 4 divisors (see below), whose sum is σ = 20425223619360. Its totient is φ = 20405659224748.
The previous prime is 20415441422021. The next prime is 20415441422059. The reversal of 20415441422053 is 35022414451402.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20415441422053 - 25 = 20415441422021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20415441422059) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4891095523 + ... + 4891099696.
It is an arithmetic number, because the mean of its divisors is an integer number (5106305904840).
Almost surely, 220415441422053 is an apocalyptic number.
It is an amenable number.
20415441422053 is a deficient number, since it is larger than the sum of its proper divisors (9782197307).
20415441422053 is an equidigital number, since it uses as much as digits as its factorization.
20415441422053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9782197306.
The product of its (nonzero) digits is 153600, while the sum is 37.
Adding to 20415441422053 its reverse (35022414451402), we get a palindrome (55437855873455).
The spelling of 20415441422053 in words is "twenty trillion, four hundred fifteen billion, four hundred forty-one million, four hundred twenty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •