Base | Representation |
---|---|
bin | 1100110011100110110… |
… | …1000001010000001101 |
3 | 210000212222022220122110 |
4 | 3030321231001100031 |
5 | 12101040411410041 |
6 | 245023304334233 |
7 | 21616042225110 |
oct | 3147155012015 |
9 | 700788286573 |
10 | 220011435021 |
11 | 853407a0554 |
12 | 36781474379 |
13 | 1799319b8a1 |
14 | a911b02577 |
15 | 5aca1ed516 |
hex | 3339b4140d |
220011435021 has 32 divisors (see below), whose sum is σ = 338302873600. Its totient is φ = 124582147200.
The previous prime is 220011435019. The next prime is 220011435031. The reversal of 220011435021 is 120534110022.
It is not a de Polignac number, because 220011435021 - 21 = 220011435019 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220011435031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1212120 + ... + 1381758.
It is an arithmetic number, because the mean of its divisors is an integer number (10571964800).
Almost surely, 2220011435021 is an apocalyptic number.
220011435021 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
220011435021 is a deficient number, since it is larger than the sum of its proper divisors (118291438579).
220011435021 is a wasteful number, since it uses less digits than its factorization.
220011435021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170209.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 220011435021 its reverse (120534110022), we get a palindrome (340545545043).
The spelling of 220011435021 in words is "two hundred twenty billion, eleven million, four hundred thirty-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •