Base | Representation |
---|---|
bin | 1100110100000011111… |
… | …0000000110101111101 |
3 | 210001012110200211112110 |
4 | 3031000332000311331 |
5 | 12101313113032201 |
6 | 245043341124233 |
7 | 21622052301663 |
oct | 3150076006575 |
9 | 701173624473 |
10 | 220133330301 |
11 | 853a3587255 |
12 | 367b6259679 |
13 | 179b250a381 |
14 | a923d92c33 |
15 | 5ad5c7a6d6 |
hex | 3340f80d7d |
220133330301 has 12 divisors (see below), whose sum is σ = 303284633856. Its totient is φ = 142021501560.
The previous prime is 220133330281. The next prime is 220133330323. The reversal of 220133330301 is 103033331022.
220133330301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 220133330301 - 210 = 220133329277 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220133330371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 38174941 + ... + 38180706.
It is an arithmetic number, because the mean of its divisors is an integer number (25273719488).
Almost surely, 2220133330301 is an apocalyptic number.
It is an amenable number.
220133330301 is a deficient number, since it is larger than the sum of its proper divisors (83151303555).
220133330301 is an equidigital number, since it uses as much as digits as its factorization.
220133330301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76355712 (or 76355681 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 220133330301 its reverse (103033331022), we get a palindrome (323166661323).
The spelling of 220133330301 in words is "two hundred twenty billion, one hundred thirty-three million, three hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •