Base | Representation |
---|---|
bin | 11001001101000… |
… | …11011010001100 |
3 | 112201211220200120 |
4 | 30212203122030 |
5 | 413111324400 |
6 | 32551424540 |
7 | 5145103014 |
oct | 1446433214 |
9 | 481756616 |
10 | 211433100 |
11 | a93918aa |
12 | 5a985150 |
13 | 34a5b258 |
14 | 2011ac44 |
15 | 13866ca0 |
hex | c9a368c |
211433100 has 36 divisors (see below), whose sum is σ = 611747304. Its totient is φ = 56382080.
The previous prime is 211433081. The next prime is 211433141. The reversal of 211433100 is 1334112.
It is a super-2 number, since 2×2114331002 = 89407911551220000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 211433100.
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 11 ways as a sum of consecutive naturals, for example, 352089 + ... + 352688.
Almost surely, 2211433100 is an apocalyptic number.
211433100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211433100 is an abundant number, since it is smaller than the sum of its proper divisors (400314204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211433100 is a wasteful number, since it uses less digits than its factorization.
211433100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 704794 (or 704787 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 211433100 is about 14540.7393209561. The cubic root of 211433100 is about 595.7412318994.
Adding to 211433100 its reverse (1334112), we get a palindrome (212767212).
The spelling of 211433100 in words is "two hundred eleven million, four hundred thirty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •