Base | Representation |
---|---|
bin | 10011101101100001… |
… | …001100111111110000 |
3 | 2000122000020212220211 |
4 | 103231201030333300 |
5 | 321321140221420 |
6 | 13420054313504 |
7 | 1346324414413 |
oct | 235541147760 |
9 | 60560225824 |
10 | 21164773360 |
11 | 8a80a65535 |
12 | 4128058894 |
13 | 1cc3ab7143 |
14 | 104ac85b7a |
15 | 83d148e5a |
hex | 4ed84cff0 |
21164773360 has 40 divisors (see below), whose sum is σ = 51798001680. Its totient is φ = 8020334592.
The previous prime is 21164773297. The next prime is 21164773361. The reversal of 21164773360 is 6337746112.
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21164773361) 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 7 ways as a sum of consecutive naturals, for example, 6960577 + ... + 6963616.
It is an arithmetic number, because the mean of its divisors is an integer number (1294950042).
Almost surely, 221164773360 is an apocalyptic number.
21164773360 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21164773360 is an abundant number, since it is smaller than the sum of its proper divisors (30633228320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21164773360 is a wasteful number, since it uses less digits than its factorization.
21164773360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13924225 (or 13924219 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 40.
The spelling of 21164773360 in words is "twenty-one billion, one hundred sixty-four million, seven hundred seventy-three thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.191 sec. • engine limits •