Base | Representation |
---|---|
bin | 110010010000000111100110… |
… | …100110111100111101011001 |
3 | 1001222112100102222101120201021 |
4 | 302100013212212330331121 |
5 | 212432011440241333423 |
6 | 2102014332020522441 |
7 | 64360305600250111 |
oct | 6220074646747531 |
9 | 1058470388346637 |
10 | 221010001121113 |
11 | 644698a6a06626 |
12 | 20955276250421 |
13 | 96421cc82bc99 |
14 | 3c80d26660041 |
15 | 1a83e9d6bb95d |
hex | c901e69bcf59 |
221010001121113 has 2 divisors, whose sum is σ = 221010001121114. Its totient is φ = 221010001121112.
The previous prime is 221010001121111. The next prime is 221010001121123. The reversal of 221010001121113 is 311121100010122.
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., 190545253338969 + 30464747782144 = 13803813^2 + 5519488^2 .
It is a cyclic number.
It is not a de Polignac number, because 221010001121113 - 21 = 221010001121111 is a prime.
Together with 221010001121111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (221010001121111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110505000560556 + 110505000560557.
It is an arithmetic number, because the mean of its divisors is an integer number (110505000560557).
Almost surely, 2221010001121113 is an apocalyptic number.
It is an amenable number.
221010001121113 is a deficient number, since it is larger than the sum of its proper divisors (1).
221010001121113 is an equidigital number, since it uses as much as digits as its factorization.
221010001121113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 221010001121113 its reverse (311121100010122), we get a palindrome (532131101131235).
The spelling of 221010001121113 in words is "two hundred twenty-one trillion, ten billion, one million, one hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •