Base | Representation |
---|---|
bin | 11001001100101… |
… | …01100100011100 |
3 | 112201202000221000 |
4 | 30212111210130 |
5 | 413103021122 |
6 | 32550310300 |
7 | 5144445522 |
oct | 1446254434 |
9 | 481660830 |
10 | 211376412 |
11 | a9353255 |
12 | 5a958390 |
13 | 34a3b500 |
14 | 20104312 |
15 | 138550ac |
hex | c99591c |
211376412 has 144 divisors (see below), whose sum is σ = 611395680. Its totient is φ = 63078912.
The previous prime is 211376411. The next prime is 211376423. The reversal of 211376412 is 214673112.
211376412 is a `hidden beast` number, since 2 + 1 + 13 + 7 + 641 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211376411) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 675168 + ... + 675480.
Almost surely, 2211376412 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 211376412, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (305697840).
211376412 is an abundant number, since it is smaller than the sum of its proper divisors (400019268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211376412 is a wasteful number, since it uses less digits than its factorization.
211376412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389 (or 368 counting only the distinct ones).
The product of its digits is 2016, while the sum is 27.
The square root of 211376412 is about 14538.7899083796. The cubic root of 211376412 is about 595.6879851158.
The spelling of 211376412 in words is "two hundred eleven million, three hundred seventy-six thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •