Base | Representation |
---|---|
bin | 11001011110110… |
… | …11111111110000 |
3 | 112220020020101022 |
4 | 30233123333300 |
5 | 414210341112 |
6 | 33113355012 |
7 | 5203642631 |
oct | 1457337760 |
9 | 486206338 |
10 | 213762032 |
11 | aa732640 |
12 | 5b708a68 |
13 | 35395313 |
14 | 20565888 |
15 | 13b76d72 |
hex | cbdbff0 |
213762032 has 40 divisors (see below), whose sum is σ = 456077952. Its totient is φ = 96248000.
The previous prime is 213762013. The next prime is 213762049. The reversal of 213762032 is 230267312.
It is a junction number, because it is equal to n+sod(n) for n = 213761992 and 213762010.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13157 + ... + 24507.
Almost surely, 2213762032 is an apocalyptic number.
213762032 is a gapful number since it is divisible by the number (22) 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 213762032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (228038976).
213762032 is an abundant number, since it is smaller than the sum of its proper divisors (242315920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
213762032 is a wasteful number, since it uses less digits than its factorization.
213762032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11477 (or 11471 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 26.
The square root of 213762032 is about 14620.6029971407. The cubic root of 213762032 is about 597.9206092895.
The spelling of 213762032 in words is "two hundred thirteen million, seven hundred sixty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •