Base | Representation |
---|---|
bin | 1001011010010100011000… |
… | …11010110111000010101001 |
3 | 2201021110201120000001210120 |
4 | 10231022030122313002221 |
5 | 10203033400110033221 |
6 | 112003215114233453 |
7 | 4234125662625126 |
oct | 455121432670251 |
9 | 81243646001716 |
10 | 20695508283561 |
11 | 6659a08993691 |
12 | 23a2b17a25889 |
13 | b71768cb76a7 |
14 | 51794cbb174d |
15 | 25d50e9395c6 |
hex | 12d28c6b70a9 |
20695508283561 has 8 divisors (see below), whose sum is σ = 28267035704544. Its totient is φ = 13460493192480.
The previous prime is 20695508283559. The next prime is 20695508283623. The reversal of 20695508283561 is 16538280559602.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20695508283561 - 21 = 20695508283559 is a prime.
It is a super-2 number, since 2×206955082835612 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20695508283495 and 20695508283504.
It is not an unprimeable number, because it can be changed into a prime (20695508283511) 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, 84128082331 + ... + 84128082576.
It is an arithmetic number, because the mean of its divisors is an integer number (3533379463068).
Almost surely, 220695508283561 is an apocalyptic number.
It is an amenable number.
20695508283561 is a deficient number, since it is larger than the sum of its proper divisors (7571527420983).
20695508283561 is a wasteful number, since it uses less digits than its factorization.
20695508283561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168256164951.
The product of its (nonzero) digits is 31104000, while the sum is 60.
The spelling of 20695508283561 in words is "twenty trillion, six hundred ninety-five billion, five hundred eight million, two hundred eighty-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •