Base | Representation |
---|---|
bin | 101001000001… |
… | …0111010011100 |
3 | 1111110201001222 |
4 | 1102002322130 |
5 | 21001221430 |
6 | 2044552512 |
7 | 350545532 |
oct | 122027234 |
9 | 44421058 |
10 | 21507740 |
11 | 111600a1 |
12 | 7252738 |
13 | 45c0797 |
14 | 2bdc152 |
15 | 1d4c9e5 |
hex | 1482e9c |
21507740 has 48 divisors (see below), whose sum is σ = 46902240. Its totient is φ = 8279040.
The previous prime is 21507709. The next prime is 21507743. The reversal of 21507740 is 4770512.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21507743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 76400 + ... + 76680.
It is an arithmetic number, because the mean of its divisors is an integer number (977130).
Almost surely, 221507740 is an apocalyptic number.
21507740 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21507740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23451120).
21507740 is an abundant number, since it is smaller than the sum of its proper divisors (25394500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21507740 is a wasteful number, since it uses less digits than its factorization.
21507740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422 (or 420 counting only the distinct ones).
The product of its (nonzero) digits is 1960, while the sum is 26.
The square root of 21507740 is about 4637.6437983097. The cubic root of 21507740 is about 278.0982521093.
The spelling of 21507740 in words is "twenty-one million, five hundred seven thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •