Base | Representation |
---|---|
bin | 1001110111101011111111… |
… | …10001001111111000111101 |
3 | 2211211221101211020110112200 |
4 | 10323311333301033320331 |
5 | 10321102022010111021 |
6 | 114054543422222113 |
7 | 4400051360365053 |
oct | 473657761177075 |
9 | 84757354213480 |
10 | 21704613363261 |
11 | 6a08969450734 |
12 | 25265bb124939 |
13 | c1597573514a |
14 | 55071a5841d3 |
15 | 2798c06d7126 |
hex | 13bd7fc4fe3d |
21704613363261 has 12 divisors (see below), whose sum is σ = 31819035180192. Its totient is φ = 14253775939656.
The previous prime is 21704613363259. The next prime is 21704613363281. The reversal of 21704613363261 is 16236331640712.
21704613363261 is a `hidden beast` number, since 2 + 1 + 7 + 0 + 4 + 6 + 1 + 3 + 3 + 632 + 6 + 1 = 666.
It is not a de Polignac number, because 21704613363261 - 21 = 21704613363259 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21704613363241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17997191241 + ... + 17997192446.
It is an arithmetic number, because the mean of its divisors is an integer number (2651586265016).
Almost surely, 221704613363261 is an apocalyptic number.
It is an amenable number.
21704613363261 is a deficient number, since it is larger than the sum of its proper divisors (10114421816931).
21704613363261 is a wasteful number, since it uses less digits than its factorization.
21704613363261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35994383760 (or 35994383757 counting only the distinct ones).
The product of its (nonzero) digits is 653184, while the sum is 45.
The spelling of 21704613363261 in words is "twenty-one trillion, seven hundred four billion, six hundred thirteen million, three hundred sixty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •