Base | Representation |
---|---|
bin | 1001011000001100010100… |
… | …01100110110000100100001 |
3 | 2201000111011110101121022012 |
4 | 10230012022030312010201 |
5 | 10200334242343023410 |
6 | 111505454211322305 |
7 | 4225631461641206 |
oct | 454061214660441 |
9 | 81014143347265 |
10 | 20622456611105 |
11 | 6630a31148968 |
12 | 239092abb0395 |
13 | b678c65660bb |
14 | 5141bcb81cad |
15 | 25b686479605 |
hex | 12c18a336121 |
20622456611105 has 4 divisors (see below), whose sum is σ = 24746947933332. Its totient is φ = 16497965288880.
The previous prime is 20622456611077. The next prime is 20622456611117. The reversal of 20622456611105 is 50111665422602.
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 6855269718049 + 13767186893056 = 2618257^2 + 3710416^2 .
It is not a de Polignac number, because 20622456611105 - 210 = 20622456610081 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2062245661106 + ... + 2062245661115.
It is an arithmetic number, because the mean of its divisors is an integer number (6186736983333).
Almost surely, 220622456611105 is an apocalyptic number.
It is an amenable number.
20622456611105 is a deficient number, since it is larger than the sum of its proper divisors (4124491322227).
20622456611105 is an equidigital number, since it uses as much as digits as its factorization.
20622456611105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4124491322226.
The product of its (nonzero) digits is 172800, while the sum is 41.
The spelling of 20622456611105 in words is "twenty trillion, six hundred twenty-two billion, four hundred fifty-six million, six hundred eleven thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •