Base | Representation |
---|---|
bin | 101000111101… |
… | …1001101110000 |
3 | 1111102002211010 |
4 | 1101323031300 |
5 | 20444214313 |
6 | 2044150520 |
7 | 350354565 |
oct | 121731560 |
9 | 44362733 |
10 | 21476208 |
11 | 11139436 |
12 | 7238440 |
13 | 45ac320 |
14 | 2bd086c |
15 | 1d434c3 |
hex | 147b370 |
21476208 has 80 divisors (see below), whose sum is σ = 60440576. Its totient is φ = 6531840.
The previous prime is 21476207. The next prime is 21476261. The reversal of 21476208 is 80267412.
It is a super-2 number, since 2×214762082 = 922455020118528, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21476201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 79113 + ... + 79383.
Almost surely, 221476208 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21476208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30220288).
21476208 is an abundant number, since it is smaller than the sum of its proper divisors (38964368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21476208 is a wasteful number, since it uses less digits than its factorization.
21476208 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422 (or 416 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 30.
The square root of 21476208 is about 4634.2429802504. The cubic root of 21476208 is about 277.9622811686.
It can be divided in two parts, 2147620 and 8, that added together give a triangular number (2147628 = T2072).
The spelling of 21476208 in words is "twenty-one million, four hundred seventy-six thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •