Base | Representation |
---|---|
bin | 110010000001100100101011… |
… | …110010101011100000000111 |
3 | 1001211222210101110100012111001 |
4 | 302001210223302223200013 |
5 | 212314122332204141041 |
6 | 2055531222005554131 |
7 | 64225141443546013 |
oct | 6201445362534007 |
9 | 1054883343305431 |
10 | 220010434443271 |
11 | 641139a064601a |
12 | 208135b5415947 |
13 | 959bb83270bb4 |
14 | 3c487c19b3543 |
15 | 1a67e99eec131 |
hex | c8192bcab807 |
220010434443271 has 2 divisors, whose sum is σ = 220010434443272. Its totient is φ = 220010434443270.
The previous prime is 220010434443269. The next prime is 220010434443329. The reversal of 220010434443271 is 172344434010022.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 220010434443271 - 21 = 220010434443269 is a prime.
Together with 220010434443269, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 220010434443271.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220010434443671) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110005217221635 + 110005217221636.
It is an arithmetic number, because the mean of its divisors is an integer number (110005217221636).
Almost surely, 2220010434443271 is an apocalyptic number.
220010434443271 is a deficient number, since it is larger than the sum of its proper divisors (1).
220010434443271 is an equidigital number, since it uses as much as digits as its factorization.
220010434443271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129024, while the sum is 37.
Adding to 220010434443271 its reverse (172344434010022), we get a palindrome (392354868453293).
The spelling of 220010434443271 in words is "two hundred twenty trillion, ten billion, four hundred thirty-four million, four hundred forty-three thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •