Base | Representation |
---|---|
bin | 1000010010000011… |
… | …1101000010001001 |
3 | 12201221101211202002 |
4 | 2010200331002021 |
5 | 14023121343423 |
6 | 1004335320345 |
7 | 106044103235 |
oct | 20440750211 |
9 | 5657354662 |
10 | 2223231113 |
11 | a40a57494 |
12 | 5206800b5 |
13 | 2957a668c |
14 | 1713a75c5 |
15 | d02aa228 |
hex | 8483d089 |
2223231113 has 2 divisors, whose sum is σ = 2223231114. Its totient is φ = 2223231112.
The previous prime is 2223231103. The next prime is 2223231137. The reversal of 2223231113 is 3111323222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1362864889 + 860366224 = 36917^2 + 29332^2 .
It is a cyclic number.
It is not a de Polignac number, because 2223231113 - 224 = 2206453897 is a prime.
It is a super-2 number, since 2×22232311132 = 9885513163622437538, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2223231103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1111615556 + 1111615557.
It is an arithmetic number, because the mean of its divisors is an integer number (1111615557).
Almost surely, 22223231113 is an apocalyptic number.
It is an amenable number.
2223231113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2223231113 is an equidigital number, since it uses as much as digits as its factorization.
2223231113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 432, while the sum is 20.
The square root of 2223231113 is about 47151.1517674807. The cubic root of 2223231113 is about 1305.1533342042.
Adding to 2223231113 its reverse (3111323222), we get a palindrome (5334554335).
The spelling of 2223231113 in words is "two billion, two hundred twenty-three million, two hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •