Base | Representation |
---|---|
bin | 10110110010011010000101… |
… | …110000101010011001111001 |
3 | 111010212000221120112011122212 |
4 | 112302122011300222121321 |
5 | 101114010112304324233 |
6 | 553052521415424505 |
7 | 30052505036554532 |
oct | 2662320560523171 |
9 | 433760846464585 |
10 | 100221011011193 |
11 | 29a2a545a61036 |
12 | b2a7605985135 |
13 | 43bca54433b07 |
14 | 1aa6a19591689 |
15 | b8bea2618a48 |
hex | 5b2685c2a679 |
100221011011193 has 2 divisors, whose sum is σ = 100221011011194. Its totient is φ = 100221011011192.
The previous prime is 100221011011189. The next prime is 100221011011241. The reversal of 100221011011193 is 391110110122001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 57588625706089 + 42632385305104 = 7588717^2 + 6529348^2 .
It is a cyclic number.
It is not a de Polignac number, because 100221011011193 - 22 = 100221011011189 is a prime.
It is not a weakly prime, because it can be changed into another prime (100221011011493) 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 as a sum of consecutive naturals, namely, 50110505505596 + 50110505505597.
It is an arithmetic number, because the mean of its divisors is an integer number (50110505505597).
Almost surely, 2100221011011193 is an apocalyptic number.
It is an amenable number.
100221011011193 is a deficient number, since it is larger than the sum of its proper divisors (1).
100221011011193 is an equidigital number, since it uses as much as digits as its factorization.
100221011011193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 23.
Adding to 100221011011193 its reverse (391110110122001), we get a palindrome (491331121133194).
The spelling of 100221011011193 in words is "one hundred trillion, two hundred twenty-one billion, eleven million, eleven thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •