Base | Representation |
---|---|
bin | 10001100111000000001… |
… | …111001100110010101000 |
3 | 11021200111201101011012002 |
4 | 101213000033030302220 |
5 | 124311301410121300 |
6 | 2323530050510132 |
7 | 153266451646025 |
oct | 21470017146250 |
9 | 4250451334162 |
10 | 1210111020200 |
11 | 42722913a235 |
12 | 17663b895348 |
13 | 8a1612a69b4 |
14 | 427d930a54c |
15 | 217276c85d5 |
hex | 119c03ccca8 |
1210111020200 has 72 divisors (see below), whose sum is σ = 2867596117050. Its totient is φ = 474911274240.
The previous prime is 1210111020199. The next prime is 1210111020203. The reversal of 1210111020200 is 20201110121.
It can be written as a sum of positive squares in 9 ways, for example, as 58022210884 + 1152088809316 = 240878^2 + 1073354^2 .
It is not an unprimeable number, because it can be changed into a prime (1210111020203) by changing a digit.
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 17 ways as a sum of consecutive naturals, for example, 515195 + ... + 1638794.
Almost surely, 21210111020200 is an apocalyptic number.
1210111020200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1210111020200 is an abundant number, since it is smaller than the sum of its proper divisors (1657485096850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1210111020200 is a wasteful number, since it uses less digits than its factorization.
1210111020200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2154111 (or 2154049 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1210111020200 its reverse (20201110121), we get a palindrome (1230312130321).
The spelling of 1210111020200 in words is "one trillion, two hundred ten billion, one hundred eleven million, twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •