Base | Representation |
---|---|
bin | 110000000001100000101001… |
… | …101111101101001111000010 |
3 | 1000200211110221220010211000120 |
4 | 300001200221233231033002 |
5 | 210140431101100320002 |
6 | 2025112312353401110 |
7 | 62326263665206320 |
oct | 6001405157551702 |
9 | 1020743856124016 |
10 | 211210012120002 |
11 | 613307326763a5 |
12 | 1b831ab9869196 |
13 | 90b103207405c |
14 | 3a22894c76d10 |
15 | 19640ccb71cbc |
hex | c01829bed3c2 |
211210012120002 has 128 divisors (see below), whose sum is σ = 504041539276800. Its totient is φ = 57740757154560.
The previous prime is 211210012120001. The next prime is 211210012120069. The reversal of 211210012120002 is 200021210012112.
It is not an unprimeable number, because it can be changed into a prime (211210012120001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 483136123 + ... + 483573089.
It is an arithmetic number, because the mean of its divisors is an integer number (3937824525600).
Almost surely, 2211210012120002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 211210012120002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (252020769638400).
211210012120002 is an abundant number, since it is smaller than the sum of its proper divisors (292831527156798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211210012120002 is a wasteful number, since it uses less digits than its factorization.
211210012120002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 442176.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 211210012120002 its reverse (200021210012112), we get a palindrome (411231222132114).
The spelling of 211210012120002 in words is "two hundred eleven trillion, two hundred ten billion, twelve million, one hundred twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •