Base | Representation |
---|---|
bin | 11001010100111… |
… | …11010101000000 |
3 | 112210210100010121 |
4 | 30222133111000 |
5 | 413342334320 |
6 | 33025510024 |
7 | 5156631241 |
oct | 1452372500 |
9 | 483710117 |
10 | 212464960 |
11 | a9a27084 |
12 | 5b1a2314 |
13 | 3502cb16 |
14 | 20308cc8 |
15 | 139bc8aa |
hex | ca9f540 |
212464960 has 56 divisors (see below), whose sum is σ = 509275080. Its totient is φ = 84424704.
The previous prime is 212464939. The next prime is 212465027. The reversal of 212464960 is 69464212.
It can be written as a sum of positive squares in 4 ways, for example, as 63234304 + 149230656 = 7952^2 + 12216^2 .
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 48126 + ... + 52354.
Almost surely, 2212464960 is an apocalyptic number.
212464960 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 212464960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (254637540).
212464960 is an abundant number, since it is smaller than the sum of its proper divisors (296810120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212464960 is a wasteful number, since it uses less digits than its factorization.
212464960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4403 (or 4393 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 34.
The square root of 212464960 is about 14576.1778254795. The cubic root of 212464960 is about 596.7087944344.
The spelling of 212464960 in words is "two hundred twelve million, four hundred sixty-four thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •