Base | Representation |
---|---|
bin | 10100011101011110… |
… | …101011001010011100 |
3 | 2002201002100000021221 |
4 | 110131132223022130 |
5 | 324443132314420 |
6 | 14032000503124 |
7 | 1405264651006 |
oct | 243536531234 |
9 | 62632300257 |
10 | 21969416860 |
11 | 9354188066 |
12 | 431161aaa4 |
13 | 20c1704761 |
14 | 10c5a9d376 |
15 | 888adbcaa |
hex | 51d7ab29c |
21969416860 has 12 divisors (see below), whose sum is σ = 46135775448. Its totient is φ = 8787766736.
The previous prime is 21969416857. The next prime is 21969416867. The reversal of 21969416860 is 6861496912.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 21969416798 and 21969416807.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21969416867) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 549235402 + ... + 549235441.
It is an arithmetic number, because the mean of its divisors is an integer number (3844647954).
Almost surely, 221969416860 is an apocalyptic number.
21969416860 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21969416860 is an abundant number, since it is smaller than the sum of its proper divisors (24166358588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21969416860 is a wasteful number, since it uses less digits than its factorization.
21969416860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1098470852 (or 1098470850 counting only the distinct ones).
The product of its (nonzero) digits is 1119744, while the sum is 52.
The spelling of 21969416860 in words is "twenty-one billion, nine hundred sixty-nine million, four hundred sixteen thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •