Base | Representation |
---|---|
bin | 1100110101100101110… |
… | …1000001000111000011 |
3 | 210002021002122122210000 |
4 | 3031121131001013003 |
5 | 12103133243023133 |
6 | 245152213411043 |
7 | 21635201004324 |
oct | 3153135010703 |
9 | 702232578700 |
10 | 220544111043 |
11 | 85594445973 |
12 | 368ab939a83 |
13 | 17a496549b9 |
14 | a96276244b |
15 | 5b0bd6d413 |
hex | 33597411c3 |
220544111043 has 10 divisors (see below), whose sum is σ = 329454783284. Its totient is φ = 147029407308.
The previous prime is 220544110987. The next prime is 220544111057. The reversal of 220544111043 is 340111445022.
220544111043 is a `hidden beast` number, since 2 + 2 + 0 + 544 + 1 + 110 + 4 + 3 = 666.
It is not a de Polignac number, because 220544111043 - 212 = 220544106947 is a prime.
It is a super-2 number, since 2×2205441110432 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220544110998 and 220544111016.
It is not an unprimeable number, because it can be changed into a prime (220544111083) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1361383321 + ... + 1361383482.
Almost surely, 2220544111043 is an apocalyptic number.
220544111043 is a deficient number, since it is larger than the sum of its proper divisors (108910672241).
220544111043 is an equidigital number, since it uses as much as digits as its factorization.
220544111043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2722766815 (or 2722766806 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 220544111043 its reverse (340111445022), we get a palindrome (560655556065).
The spelling of 220544111043 in words is "two hundred twenty billion, five hundred forty-four million, one hundred eleven thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •