Base | Representation |
---|---|
bin | 10010110101001110… |
… | …11011111010111011 |
3 | 222002121011111022002 |
4 | 21122213123322323 |
5 | 131201204101021 |
6 | 4351121051215 |
7 | 505353316631 |
oct | 113247337273 |
9 | 28077144262 |
10 | 10110222011 |
11 | 4318a5848a |
12 | 1b61a86b0b |
13 | c5179c8b6 |
14 | 6bca55351 |
15 | 3e28d150b |
hex | 25a9dbebb |
10110222011 has 4 divisors (see below), whose sum is σ = 10178076000. Its totient is φ = 10042368024.
The previous prime is 10110222007. The next prime is 10110222041. The reversal of 10110222011 is 11022201101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11022201101 = 373 ⋅29550137.
It is a cyclic number.
It is not a de Polignac number, because 10110222011 - 22 = 10110222007 is a prime.
It is a super-2 number, since 2×101102220112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10110221983 and 10110222001.
It is not an unprimeable number, because it can be changed into a prime (10110222041) 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, 33926771 + ... + 33927068.
It is an arithmetic number, because the mean of its divisors is an integer number (2544519000).
Almost surely, 210110222011 is an apocalyptic number.
10110222011 is a deficient number, since it is larger than the sum of its proper divisors (67853989).
10110222011 is an equidigital number, since it uses as much as digits as its factorization.
10110222011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67853988.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10110222011 its reverse (11022201101), we get a palindrome (21132423112).
The spelling of 10110222011 in words is "ten billion, one hundred ten million, two hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •