Base | Representation |
---|---|
bin | 10100001010110010… |
… | …011011011001110001 |
3 | 2001220020021001100201 |
4 | 110022302123121301 |
5 | 323322342444311 |
6 | 13540515315201 |
7 | 1364436334006 |
oct | 241262333161 |
9 | 61806231321 |
10 | 21655828081 |
11 | 9203172188 |
12 | 42445abb01 |
13 | 2071759774 |
14 | 109618d8ad |
15 | 86b2e69c1 |
hex | 50ac9b671 |
21655828081 has 8 divisors (see below), whose sum is σ = 21814073064. Its totient is φ = 21497963520.
The previous prime is 21655828057. The next prime is 21655828091. The reversal of 21655828081 is 18082855612.
It can be written as a sum of positive squares in 4 ways, for example, as 3838917681 + 17816910400 = 61959^2 + 133480^2 .
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 21655828081 - 25 = 21655828049 is a prime.
It is a super-2 number, since 2×216558280812 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21655828091) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 19665 + ... + 209041.
It is an arithmetic number, because the mean of its divisors is an integer number (2726759133).
Almost surely, 221655828081 is an apocalyptic number.
It is an amenable number.
21655828081 is a deficient number, since it is larger than the sum of its proper divisors (158244983).
21655828081 is a wasteful number, since it uses less digits than its factorization.
21655828081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190211.
The product of its (nonzero) digits is 307200, while the sum is 46.
The spelling of 21655828081 in words is "twenty-one billion, six hundred fifty-five million, eight hundred twenty-eight thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •