Base | Representation |
---|---|
bin | 1100110011100110101… |
… | …1101111101101101001 |
3 | 210000212221200221111112 |
4 | 3030321223233231221 |
5 | 12101040320213113 |
6 | 245023253240105 |
7 | 21616036334303 |
oct | 3147153575551 |
9 | 700787627445 |
10 | 220011101033 |
11 | 85340592629 |
12 | 36781333035 |
13 | 179930b2869 |
14 | a911a56973 |
15 | 5aca1845a8 |
hex | 3339aefb69 |
220011101033 has 4 divisors (see below), whose sum is σ = 222189428868. Its totient is φ = 217832773200.
The previous prime is 220011101003. The next prime is 220011101071. The reversal of 220011101033 is 330101110022.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 191903572624 + 28107528409 = 438068^2 + 167653^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220011101033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220011100999 and 220011101017.
It is not an unprimeable number, because it can be changed into a prime (220011101003) 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, 1089163766 + ... + 1089163967.
It is an arithmetic number, because the mean of its divisors is an integer number (55547357217).
Almost surely, 2220011101033 is an apocalyptic number.
It is an amenable number.
220011101033 is a deficient number, since it is larger than the sum of its proper divisors (2178327835).
220011101033 is a wasteful number, since it uses less digits than its factorization.
220011101033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2178327834.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 220011101033 its reverse (330101110022), we get a palindrome (550112211055).
The spelling of 220011101033 in words is "two hundred twenty billion, eleven million, one hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •