Base | Representation |
---|---|
bin | 1001000110001001000010… |
… | …1011100011000111011101 |
3 | 1022102002121122011001222010 |
4 | 2101202100223203013131 |
5 | 2302324233431401341 |
6 | 33134240321541433 |
7 | 2051361600366141 |
oct | 221422053430735 |
9 | 38362548131863 |
10 | 10001111200221 |
11 | 32064a15a9209 |
12 | 1156347aa4879 |
13 | 57714042b14b |
14 | 2680b0945221 |
15 | 12524278c716 |
hex | 91890ae31dd |
10001111200221 has 16 divisors (see below), whose sum is σ = 13348085377536. Its totient is φ = 6660772931376.
The previous prime is 10001111200211. The next prime is 10001111200231. The reversal of 10001111200221 is 12200211110001.
It is an interprime number because it is at equal distance from previous prime (10001111200211) and next prime (10001111200231).
It is not a de Polignac number, because 10001111200221 - 214 = 10001111183837 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10001111200197 and 10001111200206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001111200211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 66776206 + ... + 66925808.
It is an arithmetic number, because the mean of its divisors is an integer number (834255336096).
Almost surely, 210001111200221 is an apocalyptic number.
It is an amenable number.
10001111200221 is a deficient number, since it is larger than the sum of its proper divisors (3346974177315).
10001111200221 is a wasteful number, since it uses less digits than its factorization.
10001111200221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171632.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10001111200221 its reverse (12200211110001), we get a palindrome (22201322310222).
The spelling of 10001111200221 in words is "ten trillion, one billion, one hundred eleven million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •