Base | Representation |
---|---|
bin | 10110101111001101011001… |
… | …010100111101110110010001 |
3 | 111010002000122010010210120121 |
4 | 112233031121110331312101 |
5 | 101101410000342034301 |
6 | 552403532143110241 |
7 | 30030564336640330 |
oct | 2657153124756621 |
9 | 433060563123517 |
10 | 100001222221201 |
11 | 29955309a10044 |
12 | b270aa6ba2381 |
13 | 43a50c841a862 |
14 | 1a9a129287d17 |
15 | b863dbc493a1 |
hex | 5af35953dd91 |
100001222221201 has 32 divisors (see below), whose sum is σ = 115645966276608. Its totient is φ = 84699625190400.
The previous prime is 100001222221189. The next prime is 100001222221213. The reversal of 100001222221201 is 102122222100001.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (100001222221189) and next prime (100001222221213).
It is not a de Polignac number, because 100001222221201 - 25 = 100001222221169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100001222221001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1395985881 + ... + 1396057513.
It is an arithmetic number, because the mean of its divisors is an integer number (3613936446144).
Almost surely, 2100001222221201 is an apocalyptic number.
It is an amenable number.
100001222221201 is a deficient number, since it is larger than the sum of its proper divisors (15644744055407).
100001222221201 is a wasteful number, since it uses less digits than its factorization.
100001222221201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75601.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 100001222221201 its reverse (102122222100001), we get a palindrome (202123444321202).
The spelling of 100001222221201 in words is "one hundred trillion, one billion, two hundred twenty-two million, two hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •