Base | Representation |
---|---|
bin | 10010101110101010… |
… | …100001001010010001 |
3 | 1220220111222120200211 |
4 | 102232222201022101 |
5 | 312141211010031 |
6 | 13123304244121 |
7 | 1311231211225 |
oct | 225652411221 |
9 | 56814876624 |
10 | 20110250641 |
11 | 858a791a58 |
12 | 3a92a70641 |
13 | 1b8649a0c0 |
14 | d8abc4785 |
15 | 7ca797bb1 |
hex | 4aeaa1291 |
20110250641 has 4 divisors (see below), whose sum is σ = 21657193012. Its totient is φ = 18563308272.
The previous prime is 20110250639. The next prime is 20110250659. The reversal of 20110250641 is 14605201102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6256019025 + 13854231616 = 79095^2 + 117704^2 .
It is a cyclic number.
It is not a de Polignac number, because 20110250641 - 21 = 20110250639 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20110250681) 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, 773471166 + ... + 773471191.
It is an arithmetic number, because the mean of its divisors is an integer number (5414298253).
Almost surely, 220110250641 is an apocalyptic number.
It is an amenable number.
20110250641 is a deficient number, since it is larger than the sum of its proper divisors (1546942371).
20110250641 is a wasteful number, since it uses less digits than its factorization.
20110250641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1546942370.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 20110250641 its reverse (14605201102), we get a palindrome (34715451743).
The spelling of 20110250641 in words is "twenty billion, one hundred ten million, two hundred fifty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •