Base | Representation |
---|---|
bin | 11001001101100… |
… | …10101000000100 |
3 | 112201222002012000 |
4 | 30212302220010 |
5 | 413120323203 |
6 | 32553025300 |
7 | 5145452514 |
oct | 1446625004 |
9 | 481862160 |
10 | 211495428 |
11 | a9424711 |
12 | 5a9b5230 |
13 | 34a80731 |
14 | 20135844 |
15 | 1387a4a3 |
hex | c9b2a04 |
211495428 has 48 divisors (see below), whose sum is σ = 550979520. Its totient is φ = 70156800.
The previous prime is 211495397. The next prime is 211495553. The reversal of 211495428 is 824594112.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 211495392 and 211495401.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18148 + ... + 27428.
It is an arithmetic number, because the mean of its divisors is an integer number (11478740).
Almost surely, 2211495428 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 211495428, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (275489760).
211495428 is an abundant number, since it is smaller than the sum of its proper divisors (339484092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211495428 is a wasteful number, since it uses less digits than its factorization.
211495428 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9505 (or 9497 counting only the distinct ones).
The product of its digits is 23040, while the sum is 36.
The square root of 211495428 is about 14542.8823828016. The cubic root of 211495428 is about 595.7997653260.
The spelling of 211495428 in words is "two hundred eleven million, four hundred ninety-five thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •