Base | Representation |
---|---|
bin | 10110110010011001001010… |
… | …000110111000010001011001 |
3 | 111010211221100211022210211011 |
4 | 112302121022012320101121 |
5 | 101114001040102432301 |
6 | 553052234224533521 |
7 | 30052441165044211 |
oct | 2662311206702131 |
9 | 433757324283734 |
10 | 100220010202201 |
11 | 29a2a08203546a |
12 | b2a73867812a1 |
13 | 43bc924ca2646 |
14 | 1aa69626b3241 |
15 | b8be44827a51 |
hex | 5b264a1b8459 |
100220010202201 has 2 divisors, whose sum is σ = 100220010202202. Its totient is φ = 100220010202200.
The previous prime is 100220010202199. The next prime is 100220010202211. The reversal of 100220010202201 is 102202010022001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51165409000000 + 49054601202201 = 7153000^2 + 7003899^2 .
It is a cyclic number.
It is not a de Polignac number, because 100220010202201 - 21 = 100220010202199 is a prime.
Together with 100220010202199, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (100220010202211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50110005101100 + 50110005101101.
It is an arithmetic number, because the mean of its divisors is an integer number (50110005101101).
Almost surely, 2100220010202201 is an apocalyptic number.
It is an amenable number.
100220010202201 is a deficient number, since it is larger than the sum of its proper divisors (1).
100220010202201 is an equidigital number, since it uses as much as digits as its factorization.
100220010202201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 100220010202201 its reverse (102202010022001), we get a palindrome (202422020224202).
The spelling of 100220010202201 in words is "one hundred trillion, two hundred twenty billion, ten million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •