Base | Representation |
---|---|
bin | 1100110011101000111… |
… | …0000101010001011011 |
3 | 210000220120122020211101 |
4 | 3030322032011101123 |
5 | 12101100121232420 |
6 | 245024214212231 |
7 | 21616206004003 |
oct | 3147216052133 |
9 | 700816566741 |
10 | 220020102235 |
11 | 8534568033a |
12 | 36784354077 |
13 | 17994c1490b |
14 | a912d1b003 |
15 | 5acad6160a |
hex | 333a38545b |
220020102235 has 8 divisors (see below), whose sum is σ = 279554953536. Its totient is φ = 165662194560.
The previous prime is 220020102221. The next prime is 220020102271. The reversal of 220020102235 is 532201020022.
220020102235 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220020102235 - 29 = 220020101723 is a prime.
It is a super-3 number, since 3×2200201022353 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 1294235811 + ... + 1294235980.
It is an arithmetic number, because the mean of its divisors is an integer number (34944369192).
Almost surely, 2220020102235 is an apocalyptic number.
220020102235 is a deficient number, since it is larger than the sum of its proper divisors (59534851301).
220020102235 is a wasteful number, since it uses less digits than its factorization.
220020102235 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2588471813.
The product of its (nonzero) digits is 480, while the sum is 19.
Adding to 220020102235 its reverse (532201020022), we get a palindrome (752221122257).
The spelling of 220020102235 in words is "two hundred twenty billion, twenty million, one hundred two thousand, two hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •