Base | Representation |
---|---|
bin | 10100101100000001… |
… | …000100000111110011 |
3 | 2010100002021012220201 |
4 | 110230001010013303 |
5 | 330443102004021 |
6 | 14112112220031 |
7 | 1414316021341 |
oct | 245401040763 |
9 | 63302235821 |
10 | 22213313011 |
11 | 946992192a |
12 | 437b23a617 |
13 | 21300baac6 |
14 | 110a22a991 |
15 | 8a0217591 |
hex | 52c0441f3 |
22213313011 has 4 divisors (see below), whose sum is σ = 22213877400. Its totient is φ = 22212748624.
The previous prime is 22213313009. The next prime is 22213313033. The reversal of 22213313011 is 11031331222.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11031331222 = 2 ⋅5515665611.
It is a cyclic number.
It is not a de Polignac number, because 22213313011 - 21 = 22213313009 is a prime.
It is a super-2 number, since 2×222133130112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 22213313011.
It is not an unprimeable number, because it can be changed into a prime (22213313051) 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, 218341 + ... + 303478.
It is an arithmetic number, because the mean of its divisors is an integer number (5553469350).
Almost surely, 222213313011 is an apocalyptic number.
22213313011 is a deficient number, since it is larger than the sum of its proper divisors (564389).
22213313011 is an equidigital number, since it uses as much as digits as its factorization.
22213313011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 564388.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 22213313011 its reverse (11031331222), we get a palindrome (33244644233).
The spelling of 22213313011 in words is "twenty-two billion, two hundred thirteen million, three hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •