Base | Representation |
---|---|
bin | 11001001011010… |
… | …10100010000100 |
3 | 112201102002010010 |
4 | 30211222202010 |
5 | 413031401012 |
6 | 32542430220 |
7 | 5143112553 |
oct | 1445524204 |
9 | 481362103 |
10 | 211200132 |
11 | a9242870 |
12 | 5a892370 |
13 | 349a91c0 |
14 | 20099d9a |
15 | 1381cc3c |
hex | c96a884 |
211200132 has 48 divisors (see below), whose sum is σ = 578958912. Its totient is φ = 59076480.
The previous prime is 211200103. The next prime is 211200149. The reversal of 211200132 is 231002112.
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 59823 + ... + 63254.
It is an arithmetic number, because the mean of its divisors is an integer number (12061644).
Almost surely, 2211200132 is an apocalyptic number.
211200132 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
211200132 is an abundant number, since it is smaller than the sum of its proper divisors (367758780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211200132 is a wasteful number, since it uses less digits than its factorization.
211200132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123108 (or 123106 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 211200132 is about 14532.7262411428. The cubic root of 211200132 is about 595.5223452486.
Adding to 211200132 its reverse (231002112), we get a palindrome (442202244).
It can be divided in two parts, 211200 and 132, that multiplied together give a square (27878400 = 52802).
The spelling of 211200132 in words is "two hundred eleven million, two hundred thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •