Base | Representation |
---|---|
bin | 1100110011101000111… |
… | …0111010110000110101 |
3 | 210000220121001101101010 |
4 | 3030322032322300311 |
5 | 12101100200240313 |
6 | 245024223022433 |
7 | 21616210605531 |
oct | 3147216726065 |
9 | 700817041333 |
10 | 220020321333 |
11 | 8534580aa0a |
12 | 3678443aa19 |
13 | 17994c90567 |
14 | a912d76bc1 |
15 | 5acada64c3 |
hex | 333a3bac35 |
220020321333 has 4 divisors (see below), whose sum is σ = 293360428448. Its totient is φ = 146680214220.
The previous prime is 220020321329. The next prime is 220020321343. The reversal of 220020321333 is 333123020022.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 220020321333 - 22 = 220020321329 is a prime.
It is a super-3 number, since 3×2200203213333 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220020321343) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36670053553 + ... + 36670053558.
It is an arithmetic number, because the mean of its divisors is an integer number (73340107112).
Almost surely, 2220020321333 is an apocalyptic number.
It is an amenable number.
220020321333 is a deficient number, since it is larger than the sum of its proper divisors (73340107115).
220020321333 is an equidigital number, since it uses as much as digits as its factorization.
220020321333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73340107114.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 220020321333 its reverse (333123020022), we get a palindrome (553143341355).
The spelling of 220020321333 in words is "two hundred twenty billion, twenty million, three hundred twenty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •