Base | Representation |
---|---|
bin | 101000101001… |
… | …1110110010000 |
3 | 1111002220121222 |
4 | 1101103312100 |
5 | 20424034320 |
6 | 2040504212 |
7 | 346113512 |
oct | 121236620 |
9 | 44086558 |
10 | 21314960 |
11 | 11039277 |
12 | 717b068 |
13 | 4553b04 |
14 | 2b8bbb2 |
15 | 1d10825 |
hex | 1453d90 |
21314960 has 80 divisors (see below), whose sum is σ = 53716800. Its totient is φ = 7838208.
The previous prime is 21314947. The next prime is 21314999. The reversal of 21314960 is 6941312.
It is a tau number, because it is divible by the number of its divisors (80).
It is an unprimeable number.
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, 56051 + ... + 56429.
It is an arithmetic number, because the mean of its divisors is an integer number (671460).
Almost surely, 221314960 is an apocalyptic number.
21314960 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 21314960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26858400).
21314960 is an abundant number, since it is smaller than the sum of its proper divisors (32401840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21314960 is a wasteful number, since it uses less digits than its factorization.
21314960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448 (or 442 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 21314960 is about 4616.8127534047. The cubic root of 21314960 is about 277.2648658851.
The spelling of 21314960 in words is "twenty-one million, three hundred fourteen thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •