Base | Representation |
---|---|
bin | 1100111011011111111… |
… | …1111000111110111111 |
3 | 210020100122100222012101 |
4 | 3032313333320332333 |
5 | 12114410324423403 |
6 | 250013435245531 |
7 | 22022411330311 |
oct | 3166777707677 |
9 | 706318328171 |
10 | 222130311103 |
11 | 86228851508 |
12 | 37072ba98a7 |
13 | 17c4016840c |
14 | aa732a37b1 |
15 | 5ba124371d |
hex | 33b7ff8fbf |
222130311103 has 4 divisors (see below), whose sum is σ = 222136454488. Its totient is φ = 222124167720.
The previous prime is 222130311097. The next prime is 222130311119. The reversal of 222130311103 is 301113031222.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 301113031222 = 2 ⋅150556515611.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-222130311103 is a prime.
It is a super-2 number, since 2×2221303111032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (222130371103) 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, 3017133 + ... + 3089878.
It is an arithmetic number, because the mean of its divisors is an integer number (55534113622).
Almost surely, 2222130311103 is an apocalyptic number.
222130311103 is a deficient number, since it is larger than the sum of its proper divisors (6143385).
222130311103 is an equidigital number, since it uses as much as digits as its factorization.
222130311103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6143384.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 222130311103 its reverse (301113031222), we get a palindrome (523243342325).
The spelling of 222130311103 in words is "two hundred twenty-two billion, one hundred thirty million, three hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •