Base | Representation |
---|---|
bin | 11101101100000101011… |
… | …01000110111101011101 |
3 | 10121112001112022220212211 |
4 | 32312002231012331131 |
5 | 113203131112042341 |
6 | 2100343313400421 |
7 | 133462013613211 |
oct | 16660255067535 |
9 | 3545045286784 |
10 | 1020100112221 |
11 | 363692a12793 |
12 | 145851569111 |
13 | 7526c626078 |
14 | 37531b4c941 |
15 | 1b8061aa181 |
hex | ed82b46f5d |
1020100112221 has 2 divisors, whose sum is σ = 1020100112222. Its totient is φ = 1020100112220.
The previous prime is 1020100112219. The next prime is 1020100112243. The reversal of 1020100112221 is 1222110010201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 724517606596 + 295582505625 = 851186^2 + 543675^2 .
It is a cyclic number.
It is not a de Polignac number, because 1020100112221 - 21 = 1020100112219 is a prime.
Together with 1020100112219, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1020100112021) 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, 510050056110 + 510050056111.
It is an arithmetic number, because the mean of its divisors is an integer number (510050056111).
Almost surely, 21020100112221 is an apocalyptic number.
It is an amenable number.
1020100112221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020100112221 is an equidigital number, since it uses as much as digits as its factorization.
1020100112221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1020100112221 its reverse (1222110010201), we get a palindrome (2242210122422).
The spelling of 1020100112221 in words is "one trillion, twenty billion, one hundred million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •