Base | Representation |
---|---|
bin | 11001010110010… |
… | …10010010110100 |
3 | 112211010021112200 |
4 | 30223022102310 |
5 | 413414002243 |
6 | 33033344500 |
7 | 5161263312 |
oct | 1453122264 |
9 | 484107480 |
10 | 212640948 |
11 | aa037323 |
12 | 5b268130 |
13 | 35091c60 |
14 | 203530b2 |
15 | 13a04ad3 |
hex | caca4b4 |
212640948 has 36 divisors (see below), whose sum is σ = 578857188. Its totient is φ = 65427840.
The previous prime is 212640943. The next prime is 212640983. The reversal of 212640948 is 849046212.
212640948 is a `hidden beast` number, since 2 + 1 + 2 + 640 + 9 + 4 + 8 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 98962704 + 113678244 = 9948^2 + 10662^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212640943) 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 11 ways as a sum of consecutive naturals, for example, 226713 + ... + 227648.
Almost surely, 2212640948 is an apocalyptic number.
It is an amenable number.
212640948 is an abundant number, since it is smaller than the sum of its proper divisors (366216240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212640948 is a wasteful number, since it uses less digits than its factorization.
212640948 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 454384 (or 454379 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The square root of 212640948 is about 14582.2134122362. The cubic root of 212640948 is about 596.8735033286.
The spelling of 212640948 in words is "two hundred twelve million, six hundred forty thousand, nine hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •