Base | Representation |
---|---|
bin | 1100010011001010010… |
… | …1001101100100010000 |
3 | 202012102000000102221220 |
4 | 3010302211031210100 |
5 | 11430221303410300 |
6 | 241023143245040 |
7 | 21160155322545 |
oct | 3046245154420 |
9 | 665360012856 |
10 | 211302013200 |
11 | 81681528a83 |
12 | 34b50749780 |
13 | 16c0599aa55 |
14 | a32712abcc |
15 | 576a7bdda0 |
hex | 313294d910 |
211302013200 has 60 divisors (see below), whose sum is σ = 676870786128. Its totient is φ = 56347203200.
The previous prime is 211302013129. The next prime is 211302013207. The reversal of 211302013200 is 2310203112.
It is a tau number, because it is divible by the number of its divisors (60).
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 211302013200.
It is not an unprimeable number, because it can be changed into a prime (211302013207) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 88041306 + ... + 88043705.
Almost surely, 2211302013200 is an apocalyptic number.
211302013200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211302013200 is an abundant number, since it is smaller than the sum of its proper divisors (465568772928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211302013200 is a wasteful number, since it uses less digits than its factorization.
211302013200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176085032 (or 176085021 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 211302013200 its reverse (2310203112), we get a palindrome (213612216312).
The spelling of 211302013200 in words is "two hundred eleven billion, three hundred two million, thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •