Base | Representation |
---|---|
bin | 110010000010111010111111… |
… | …101111110001001011100001 |
3 | 1001212022122121020200011101021 |
4 | 302002322333233301023201 |
5 | 212322132132410140111 |
6 | 2100041550122405441 |
7 | 64234632163505005 |
oct | 6202727757611341 |
9 | 1055278536604337 |
10 | 220103111021281 |
11 | 6414a229105854 |
12 | 2082955a660881 |
13 | 95a7832768a37 |
14 | 3c4d094168705 |
15 | 1a6a5c1333d71 |
hex | c82ebfbf12e1 |
220103111021281 has 2 divisors, whose sum is σ = 220103111021282. Its totient is φ = 220103111021280.
The previous prime is 220103111021279. The next prime is 220103111021293. The reversal of 220103111021281 is 182120111301022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 207487891713600 + 12615219307681 = 14404440^2 + 3551791^2 .
It is a cyclic number.
It is not a de Polignac number, because 220103111021281 - 21 = 220103111021279 is a prime.
It is a super-2 number, since 2×2201031110212812 (a number of 29 digits) contains 22 as substring.
Together with 220103111021279, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (220103111021221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110051555510640 + 110051555510641.
It is an arithmetic number, because the mean of its divisors is an integer number (110051555510641).
Almost surely, 2220103111021281 is an apocalyptic number.
It is an amenable number.
220103111021281 is a deficient number, since it is larger than the sum of its proper divisors (1).
220103111021281 is an equidigital number, since it uses as much as digits as its factorization.
220103111021281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 25.
The spelling of 220103111021281 in words is "two hundred twenty trillion, one hundred three billion, one hundred eleven million, twenty-one thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •