Base | Representation |
---|---|
bin | 1001110000111000001111… |
… | …00011001100100001110000 |
3 | 2211000120112210002210001121 |
4 | 10320130013203030201300 |
5 | 10303233412023221233 |
6 | 113355253325112024 |
7 | 4344130113212656 |
oct | 470340743144160 |
9 | 84016483083047 |
10 | 21470668179568 |
11 | 69287284a2613 |
12 | 24a91ab3b8614 |
13 | bc98a18b2b7a |
14 | 5432860d2dd6 |
15 | 27377c0e092d |
hex | 1387078cc870 |
21470668179568 has 80 divisors (see below), whose sum is σ = 43124836708800. Its totient is φ = 10348490741760.
The previous prime is 21470668179557. The next prime is 21470668179589. The reversal of 21470668179568 is 86597186607412.
It is a super-2 number, since 2×214706681795682 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21470668179497 and 21470668179506.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25251730 + ... + 26088142.
It is an arithmetic number, because the mean of its divisors is an integer number (539060458860).
Almost surely, 221470668179568 is an apocalyptic number.
It is an amenable number.
21470668179568 is an abundant number, since it is smaller than the sum of its proper divisors (21654168529232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21470668179568 is a wasteful number, since it uses less digits than its factorization.
21470668179568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 836930 (or 836924 counting only the distinct ones).
The product of its (nonzero) digits is 243855360, while the sum is 70.
The spelling of 21470668179568 in words is "twenty-one trillion, four hundred seventy billion, six hundred sixty-eight million, one hundred seventy-nine thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •