Base | Representation |
---|---|
bin | 1001100011100010010001… |
… | …01110101001011110101110 |
3 | 2202101202011100201022102010 |
4 | 10301301020232221132232 |
5 | 10223230441222400420 |
6 | 112404512125142050 |
7 | 4266036623534310 |
oct | 461611056513656 |
9 | 82352140638363 |
10 | 21012200200110 |
11 | 6771251253939 |
12 | 243437b3ba926 |
13 | b9559903b4a2 |
14 | 528dd2b177b0 |
15 | 2668977164e0 |
hex | 131c48ba97ae |
21012200200110 has 256 divisors, whose sum is σ = 63237882470400. Its totient is φ = 4359575001600.
The previous prime is 21012200200099. The next prime is 21012200200151. The reversal of 21012200200110 is 1100200221012.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 14464905 + ... + 15851115.
It is an arithmetic number, because the mean of its divisors is an integer number (247022978400).
Almost surely, 221012200200110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21012200200110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31618941235200).
21012200200110 is an abundant number, since it is smaller than the sum of its proper divisors (42225682270290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21012200200110 is a wasteful number, since it uses less digits than its factorization.
21012200200110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1386407.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 21012200200110 its reverse (1100200221012), we get a palindrome (22112400421122).
The spelling of 21012200200110 in words is "twenty-one trillion, twelve billion, two hundred million, two hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •