Base | Representation |
---|---|
bin | 1100110011111100101… |
… | …0101111000101100101 |
3 | 210001010100211112110120 |
4 | 3030333022233011211 |
5 | 12101232344023023 |
6 | 245040341312153 |
7 | 21621234401052 |
oct | 3147712570545 |
9 | 701110745416 |
10 | 220103111013 |
11 | 85388517035 |
12 | 367a8105659 |
13 | 179a9189636 |
14 | a91dd68029 |
15 | 5ad32ab8e3 |
hex | 333f2af165 |
220103111013 has 8 divisors (see below), whose sum is σ = 297006607968. Its totient is φ = 144967510704.
The previous prime is 220103111003. The next prime is 220103111071. The reversal of 220103111013 is 310111301022.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220103111013 - 26 = 220103110949 is a prime.
It is a super-3 number, since 3×2201031110133 (a number of 35 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 220103110983 and 220103111001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220103111003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 441973870 + ... + 441974367.
It is an arithmetic number, because the mean of its divisors is an integer number (37125825996).
Almost surely, 2220103111013 is an apocalyptic number.
It is an amenable number.
220103111013 is a deficient number, since it is larger than the sum of its proper divisors (76903496955).
220103111013 is an equidigital number, since it uses as much as digits as its factorization.
220103111013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 883948323.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 220103111013 its reverse (310111301022), we get a palindrome (530214412035).
The spelling of 220103111013 in words is "two hundred twenty billion, one hundred three million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •