Base | Representation |
---|---|
bin | 11001011100100… |
… | …10100110011000 |
3 | 112212122221222210 |
4 | 30232102212120 |
5 | 414121231100 |
6 | 33103115120 |
7 | 5201251305 |
oct | 1456224630 |
9 | 485587883 |
10 | 213461400 |
11 | aa547789 |
12 | 5b5a2aa0 |
13 | 352bb529 |
14 | 204c80ac |
15 | 13b17c50 |
hex | cb92998 |
213461400 has 96 divisors (see below), whose sum is σ = 664243200. Its totient is φ = 56707200.
The previous prime is 213461393. The next prime is 213461411. The reversal of 213461400 is 4164312.
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 23 ways as a sum of consecutive naturals, for example, 214905 + ... + 215895.
It is an arithmetic number, because the mean of its divisors is an integer number (6919200).
Almost surely, 2213461400 is an apocalyptic number.
213461400 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 213461400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (332121600).
213461400 is an abundant number, since it is smaller than the sum of its proper divisors (450781800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213461400 is a wasteful number, since it uses less digits than its factorization.
213461400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1369 (or 1360 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 213461400 is about 14610.3182716873. The cubic root of 213461400 is about 597.6401753248.
The spelling of 213461400 in words is "two hundred thirteen million, four hundred sixty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •