Base | Representation |
---|---|
bin | 10010101001100101… |
… | …100010000101101001 |
3 | 1220200120200022212112 |
4 | 102221211202011221 |
5 | 312002403321031 |
6 | 13111022252105 |
7 | 1306145116151 |
oct | 225145420551 |
9 | 56616608775 |
10 | 20025057641 |
11 | 8546694216 |
12 | 3a6a427035 |
13 | 1b7193c144 |
14 | d7d769761 |
15 | 7c306a62b |
hex | 4a9962169 |
20025057641 has 4 divisors (see below), whose sum is σ = 20715576900. Its totient is φ = 19334538384.
The previous prime is 20025057629. The next prime is 20025057649. The reversal of 20025057641 is 14675052002.
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 16429856041 + 3595201600 = 128179^2 + 59960^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20025057641 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20025057598 and 20025057607.
It is not an unprimeable number, because it can be changed into a prime (20025057649) 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, 345259586 + ... + 345259643.
It is an arithmetic number, because the mean of its divisors is an integer number (5178894225).
Almost surely, 220025057641 is an apocalyptic number.
It is an amenable number.
20025057641 is a deficient number, since it is larger than the sum of its proper divisors (690519259).
20025057641 is an equidigital number, since it uses as much as digits as its factorization.
20025057641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690519258.
The product of its (nonzero) digits is 16800, while the sum is 32.
The spelling of 20025057641 in words is "twenty billion, twenty-five million, fifty-seven thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •