Base | Representation |
---|---|
bin | 1000010010000001… |
… | …1111101111001001 |
3 | 12201221011202010122 |
4 | 2010200133233021 |
5 | 14023104023423 |
6 | 1004332553025 |
7 | 106043063336 |
oct | 20440375711 |
9 | 5657152118 |
10 | 2223111113 |
11 | a40985313 |
12 | 520622775 |
13 | 295763b82 |
14 | 17137598d |
15 | d02848c8 |
hex | 8481fbc9 |
2223111113 has 4 divisors (see below), whose sum is σ = 2251251840. Its totient is φ = 2194970388.
The previous prime is 2223111053. The next prime is 2223111127. The reversal of 2223111113 is 3111113222.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2223111113 - 26 = 2223111049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2223111091 and 2223111100.
It is not an unprimeable number, because it can be changed into a prime (2223111133) 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, 14070245 + ... + 14070402.
It is an arithmetic number, because the mean of its divisors is an integer number (562812960).
Almost surely, 22223111113 is an apocalyptic number.
It is an amenable number.
2223111113 is a deficient number, since it is larger than the sum of its proper divisors (28140727).
2223111113 is an equidigital number, since it uses as much as digits as its factorization.
2223111113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28140726.
The product of its digits is 72, while the sum is 17.
The square root of 2223111113 is about 47149.8792469291. The cubic root of 2223111113 is about 1305.1298516826.
Adding to 2223111113 its reverse (3111113222), we get a palindrome (5334224335).
The spelling of 2223111113 in words is "two billion, two hundred twenty-three million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •