Base | Representation |
---|---|
bin | 1001010010010011111101… |
… | …0110011100001111000110 |
3 | 1100011002022101211012210110 |
4 | 2110210333112130033012 |
5 | 2314240442212010042 |
6 | 33414300130533450 |
7 | 2102443163656353 |
oct | 224447726341706 |
9 | 40132271735713 |
10 | 10210200110022 |
11 | 3287137867910 |
12 | 118a97b437286 |
13 | 590a8275a253 |
14 | 274267b8362a |
15 | 12a8cdb0209c |
hex | 9493f59c3c6 |
10210200110022 has 128 divisors (see below), whose sum is σ = 23380135280640. Its totient is φ = 2942364839040.
The previous prime is 10210200109987. The next prime is 10210200110051. The reversal of 10210200110022 is 22001100201201.
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 63 ways as a sum of consecutive naturals, for example, 198836883 + ... + 198888225.
It is an arithmetic number, because the mean of its divisors is an integer number (182657306880).
Almost surely, 210210200110022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10210200110022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11690067640320).
10210200110022 is an abundant number, since it is smaller than the sum of its proper divisors (13169935170618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10210200110022 is a wasteful number, since it uses less digits than its factorization.
10210200110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52138.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10210200110022 its reverse (22001100201201), we get a palindrome (32211300311223).
The spelling of 10210200110022 in words is "ten trillion, two hundred ten billion, two hundred million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •