Base | Representation |
---|---|
bin | 10001100111000000110… |
… | …010010000011100011000 |
3 | 11021200112100200001111110 |
4 | 101213000302100130120 |
5 | 124311311233211300 |
6 | 2323531015500320 |
7 | 153266623033026 |
oct | 21470062203430 |
9 | 4250470601443 |
10 | 1210120210200 |
11 | 427233346880 |
12 | 1766429876a0 |
13 | 8a163173975 |
14 | 427da61d716 |
15 | 217283e1550 |
hex | 119c0c90718 |
1210120210200 has 96 divisors (see below), whose sum is σ = 4092406551360. Its totient is φ = 293362473600.
The previous prime is 1210120210151. The next prime is 1210120210207. The reversal of 1210120210200 is 20120210121.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1210120210207) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 91669174 + ... + 91682373.
It is an arithmetic number, because the mean of its divisors is an integer number (42629234910).
Almost surely, 21210120210200 is an apocalyptic number.
1210120210200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1210120210200 is an abundant number, since it is smaller than the sum of its proper divisors (2882286341160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1210120210200 is a wasteful number, since it uses less digits than its factorization.
1210120210200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183351577 (or 183351568 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1210120210200 its reverse (20120210121), we get a palindrome (1230240420321).
The spelling of 1210120210200 in words is "one trillion, two hundred ten billion, one hundred twenty million, two hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •