Base | Representation |
---|---|
bin | 1001011011110110011100… |
… | …00001100010001001001101 |
3 | 2201110111121010221120120122 |
4 | 10231323032001202021031 |
5 | 10204414202012020143 |
6 | 112043322353554325 |
7 | 4241001314531264 |
oct | 455731601421115 |
9 | 81414533846518 |
10 | 20748148548173 |
11 | 667a270a52602 |
12 | 23b1168b759a5 |
13 | b76707a57467 |
14 | 51a3040255db |
15 | 25ea90eb4c68 |
hex | 12dece06224d |
20748148548173 has 8 divisors (see below), whose sum is σ = 20787391530648. Its totient is φ = 20708923143744.
The previous prime is 20748148547993. The next prime is 20748148548191. The reversal of 20748148548173 is 37184584184702.
It can be written as a sum of positive squares in 4 ways, for example, as 3533640520804 + 17214508027369 = 1879798^2 + 4149037^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20748148548173 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 (20748148547173) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2030390 + ... + 6754167.
It is an arithmetic number, because the mean of its divisors is an integer number (2598423941331).
Almost surely, 220748148548173 is an apocalyptic number.
It is an amenable number.
20748148548173 is a deficient number, since it is larger than the sum of its proper divisors (39242982475).
20748148548173 is an equidigital number, since it uses as much as digits as its factorization.
20748148548173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8789023.
The product of its (nonzero) digits is 48168960, while the sum is 62.
The spelling of 20748148548173 in words is "twenty trillion, seven hundred forty-eight billion, one hundred forty-eight million, five hundred forty-eight thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •