Base | Representation |
---|---|
bin | 10100000101001011… |
… | …100111110001000111 |
3 | 2001122200021100121012 |
4 | 110011023213301013 |
5 | 323124303102111 |
6 | 13523315312435 |
7 | 1362215004245 |
oct | 240513476107 |
9 | 61580240535 |
10 | 21561769031 |
11 | 9165069230 |
12 | 4218bab71b |
13 | 205811611a |
14 | 10878a7795 |
15 | 862e1748b |
hex | 5052e7c47 |
21561769031 has 8 divisors (see below), whose sum is σ = 24759926400. Its totient is φ = 18569944440.
The previous prime is 21561768959. The next prime is 21561769039. The reversal of 21561769031 is 13096716512.
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-21561769031 is a prime.
It is a super-3 number, since 3×215617690313 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 21561769031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21561769039) 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, 51582971 + ... + 51583388.
It is an arithmetic number, because the mean of its divisors is an integer number (3094990800).
Almost surely, 221561769031 is an apocalyptic number.
21561769031 is a deficient number, since it is larger than the sum of its proper divisors (3198157369).
21561769031 is a wasteful number, since it uses less digits than its factorization.
21561769031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103166389.
The product of its (nonzero) digits is 68040, while the sum is 41.
The spelling of 21561769031 in words is "twenty-one billion, five hundred sixty-one million, seven hundred sixty-nine thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •