Base | Representation |
---|---|
bin | 110010000010010101101111… |
… | …101101111101111100100101 |
3 | 1001212011211100202121000012222 |
4 | 302002111233231331330211 |
5 | 212321003224044310331 |
6 | 2100011333200322125 |
7 | 64232015050551521 |
oct | 6202255755757445 |
9 | 1055154322530188 |
10 | 220063113666341 |
11 | 641342736a4010 |
12 | 20821857613345 |
13 | 95a3b2a1013ca |
14 | 3c4b17c088d81 |
15 | 1a6952ebc0b7b |
hex | c8256fb7df25 |
220063113666341 has 8 divisors (see below), whose sum is σ = 240923188824768. Its totient is φ = 199345428100000.
The previous prime is 220063113666169. The next prime is 220063113666343. The reversal of 220063113666341 is 143666311360022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 220063113666341 - 238 = 219788235759397 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220063113666292 and 220063113666301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220063113666343) 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, 35597394785 + ... + 35597400966.
It is an arithmetic number, because the mean of its divisors is an integer number (30115398603096).
Almost surely, 2220063113666341 is an apocalyptic number.
It is an amenable number.
220063113666341 is a deficient number, since it is larger than the sum of its proper divisors (20860075158427).
220063113666341 is a wasteful number, since it uses less digits than its factorization.
220063113666341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71194796043.
The product of its (nonzero) digits is 559872, while the sum is 44.
The spelling of 220063113666341 in words is "two hundred twenty trillion, sixty-three billion, one hundred thirteen million, six hundred sixty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •