Base | Representation |
---|---|
bin | 110010000100100001100010… |
… | …100011000010111011101101 |
3 | 1001212201011210200122210102201 |
4 | 302010201202203002323231 |
5 | 212330433131414222413 |
6 | 2100204315522221501 |
7 | 64245610536215113 |
oct | 6204414243027355 |
9 | 1055634720583381 |
10 | 220213216554733 |
11 | 6419199a886796 |
12 | 208469687b4891 |
13 | 95b502ba95c6c |
14 | 3c5453b37dab3 |
15 | 1a6d3b78259dd |
hex | c848628c2eed |
220213216554733 has 2 divisors, whose sum is σ = 220213216554734. Its totient is φ = 220213216554732.
The previous prime is 220213216554719. The next prime is 220213216554787. The reversal of 220213216554733 is 337455612312022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111078045973449 + 109135170581284 = 10539357^2 + 10446778^2 .
It is a cyclic number.
It is not a de Polignac number, because 220213216554733 - 221 = 220213214457581 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220213216854733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110106608277366 + 110106608277367.
It is an arithmetic number, because the mean of its divisors is an integer number (110106608277367).
Almost surely, 2220213216554733 is an apocalyptic number.
It is an amenable number.
220213216554733 is a deficient number, since it is larger than the sum of its proper divisors (1).
220213216554733 is an equidigital number, since it uses as much as digits as its factorization.
220213216554733 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1814400, while the sum is 46.
Adding to 220213216554733 its reverse (337455612312022), we get a palindrome (557668828866755).
The spelling of 220213216554733 in words is "two hundred twenty trillion, two hundred thirteen billion, two hundred sixteen million, five hundred fifty-four thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •