Base | Representation |
---|---|
bin | 1001001010111100101110… |
… | …00111010110111010100101 |
3 | 2122101222121020210012020002 |
4 | 10211132113013112322211 |
5 | 10120410322111240310 |
6 | 110520440113351045 |
7 | 4151022065612411 |
oct | 445362707267245 |
9 | 78358536705202 |
10 | 20167406743205 |
11 | 6475a49385a77 |
12 | 23186b3868485 |
13 | b33a16bb9237 |
14 | 4da171729d41 |
15 | 24e901bd3da5 |
hex | 1257971d6ea5 |
20167406743205 has 8 divisors (see below), whose sum is σ = 24492465057312. Its totient is φ = 15939540750928.
The previous prime is 20167406743177. The next prime is 20167406743207. The reversal of 20167406743205 is 50234760476102.
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-20167406743205 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20167406743205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20167406743207) 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, 24298079999 + ... + 24298080828.
It is an arithmetic number, because the mean of its divisors is an integer number (3061558132164).
Almost surely, 220167406743205 is an apocalyptic number.
It is an amenable number.
20167406743205 is a deficient number, since it is larger than the sum of its proper divisors (4325058314107).
20167406743205 is an equidigital number, since it uses as much as digits as its factorization.
20167406743205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48596160915.
The product of its (nonzero) digits is 1693440, while the sum is 47.
The spelling of 20167406743205 in words is "twenty trillion, one hundred sixty-seven billion, four hundred six million, seven hundred forty-three thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •