Base | Representation |
---|---|
bin | 10001100111000101100… |
… | …011011100001010001000 |
3 | 11021200201221012120110221 |
4 | 101213011203130022020 |
5 | 124311442223241404 |
6 | 2323542554315424 |
7 | 153301614034522 |
oct | 21470543341210 |
9 | 4250657176427 |
10 | 1210200212104 |
11 | 427274519454 |
12 | 176665728b74 |
13 | 8a176904b80 |
14 | 428070c6a12 |
15 | 21730445954 |
hex | 119c58dc288 |
1210200212104 has 64 divisors (see below), whose sum is σ = 2507856503040. Its totient is φ = 543933411840.
The previous prime is 1210200212087. The next prime is 1210200212129. The reversal of 1210200212104 is 4012120020121.
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 15 ways as a sum of consecutive naturals, for example, 2072977 + ... + 2591839.
It is an arithmetic number, because the mean of its divisors is an integer number (39185257860).
Almost surely, 21210200212104 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 1210200212104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1253928251520).
1210200212104 is an abundant number, since it is smaller than the sum of its proper divisors (1297656290936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1210200212104 is a wasteful number, since it uses less digits than its factorization.
1210200212104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 519470 (or 519466 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1210200212104 its reverse (4012120020121), we get a palindrome (5222320232225).
The spelling of 1210200212104 in words is "one trillion, two hundred ten billion, two hundred million, two hundred twelve thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.203 sec. • engine limits •