Base | Representation |
---|---|
bin | 1001010001101110000010… |
… | …1100110101011000111111 |
3 | 1100010010001002022022212111 |
4 | 2110123200230311120333 |
5 | 2314104121141210421 |
6 | 33405454151114451 |
7 | 2101633026153646 |
oct | 224334054653077 |
9 | 40103032268774 |
10 | 10200022210111 |
11 | 3282894694a88 |
12 | 11889ba972a27 |
13 | 58cb1cc52a76 |
14 | 27398015235d |
15 | 12a4d5302ee1 |
hex | 946e0b3563f |
10200022210111 has 16 divisors (see below), whose sum is σ = 10350433166080. Its totient is φ = 10050828364800.
The previous prime is 10200022210099. The next prime is 10200022210127. The reversal of 10200022210111 is 11101222000201.
It is a cyclic number.
It is not a de Polignac number, because 10200022210111 - 211 = 10200022208063 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10200022210091 and 10200022210100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10200022210711) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 23989576 + ... + 24411058.
It is an arithmetic number, because the mean of its divisors is an integer number (646902072880).
Almost surely, 210200022210111 is an apocalyptic number.
10200022210111 is a deficient number, since it is larger than the sum of its proper divisors (150410955969).
10200022210111 is a wasteful number, since it uses less digits than its factorization.
10200022210111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422926.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10200022210111 its reverse (11101222000201), we get a palindrome (21301244210312).
The spelling of 10200022210111 in words is "ten trillion, two hundred billion, twenty-two million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •