Base | Representation |
---|---|
bin | 10110110010011010000101… |
… | …110000101010011010101001 |
3 | 111010212000221120112011201122 |
4 | 112302122011300222122221 |
5 | 101114010112304324431 |
6 | 553052521415425025 |
7 | 30052505036554631 |
oct | 2662320560523251 |
9 | 433760846464648 |
10 | 100221011011241 |
11 | 29a2a545a6107a |
12 | b2a7605985175 |
13 | 43bca54433b43 |
14 | 1aa6a195916c1 |
15 | b8bea2618a7b |
hex | 5b2685c2a6a9 |
100221011011241 has 2 divisors, whose sum is σ = 100221011011242. Its totient is φ = 100221011011240.
The previous prime is 100221011011193. The next prime is 100221011011307. The reversal of 100221011011241 is 142110110122001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84665835571216 + 15555175440025 = 9201404^2 + 3944005^2 .
It is a cyclic number.
It is not a de Polignac number, because 100221011011241 - 246 = 29852266833577 is a prime.
It is a super-3 number, since 3×1002210110112413 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (100221011016241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50110505505620 + 50110505505621.
It is an arithmetic number, because the mean of its divisors is an integer number (50110505505621).
Almost surely, 2100221011011241 is an apocalyptic number.
It is an amenable number.
100221011011241 is a deficient number, since it is larger than the sum of its proper divisors (1).
100221011011241 is an equidigital number, since it uses as much as digits as its factorization.
100221011011241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 100221011011241 its reverse (142110110122001), we get a palindrome (242331121133242).
The spelling of 100221011011241 in words is "one hundred trillion, two hundred twenty-one billion, eleven million, eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •