Base | Representation |
---|---|
bin | 10001100111000101100… |
… | …010101011000111000000 |
3 | 11021200201220211100220001 |
4 | 101213011202223013000 |
5 | 124311442200324300 |
6 | 2323542550125344 |
7 | 153301612240015 |
oct | 21470542530700 |
9 | 4250656740801 |
10 | 1210200011200 |
11 | 4272743a1514 |
12 | 176665650854 |
13 | 8a1768645ab |
14 | 4280707370c |
15 | 2173040616a |
hex | 119c58ab1c0 |
1210200011200 has 84 divisors (see below), whose sum is σ = 2988919533960. Its totient is φ = 482280279040.
The previous prime is 1210200011179. The next prime is 1210200011221. The reversal of 1210200011200 is 21100020121.
It is an interprime number because it is at equal distance from previous prime (1210200011179) and next prime (1210200011221).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 975502 + ... + 1836301.
Almost surely, 21210200011200 is an apocalyptic number.
1210200011200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1210200011200 is an abundant number, since it is smaller than the sum of its proper divisors (1778719522760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1210200011200 is a wasteful number, since it uses less digits than its factorization.
1210200011200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2812094 (or 2812079 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1210200011200 its reverse (21100020121), we get a palindrome (1231300031321).
The spelling of 1210200011200 in words is "one trillion, two hundred ten billion, two hundred million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •