Base | Representation |
---|---|
bin | 1001010000011000110111… |
… | …00110111111000001000101 |
3 | 2200001212001002021222202201 |
4 | 10220030123212333001011 |
5 | 10131441113141021130 |
6 | 111142350432034501 |
7 | 4200356566504021 |
oct | 450143346770105 |
9 | 80055032258681 |
10 | 20354313220165 |
11 | 65382411a4551 |
12 | 2348976392a31 |
13 | b48532650032 |
14 | 505222899381 |
15 | 2546e08d0bca |
hex | 12831b9bf045 |
20354313220165 has 8 divisors (see below), whose sum is σ = 24667009289208. Its totient is φ = 16122228292800.
The previous prime is 20354313220159. The next prime is 20354313220177. The reversal of 20354313220165 is 56102231345302.
It can be written as a sum of positive squares in 4 ways, for example, as 990106591681 + 19364206628484 = 995041^2 + 4400478^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20354313220165 - 211 = 20354313218117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20152784862 + ... + 20152785871.
It is an arithmetic number, because the mean of its divisors is an integer number (3083376161151).
Almost surely, 220354313220165 is an apocalyptic number.
It is an amenable number.
20354313220165 is a deficient number, since it is larger than the sum of its proper divisors (4312696069043).
20354313220165 is a wasteful number, since it uses less digits than its factorization.
20354313220165 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40305570839.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 20354313220165 its reverse (56102231345302), we get a palindrome (76456544565467).
The spelling of 20354313220165 in words is "twenty trillion, three hundred fifty-four billion, three hundred thirteen million, two hundred twenty thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •