Base | Representation |
---|---|
bin | 1100000000011100… |
… | …1100000111100001 |
3 | 22022121211221212122 |
4 | 3000013030013201 |
5 | 23100104010423 |
6 | 1251454234025 |
7 | 142604661326 |
oct | 30007140741 |
9 | 8277757778 |
10 | 3223110113 |
11 | 14043a8373 |
12 | 75b4b5915 |
13 | 3c49a0762 |
14 | 2280c2b4d |
15 | 13ce658c8 |
hex | c01cc1e1 |
3223110113 has 2 divisors, whose sum is σ = 3223110114. Its totient is φ = 3223110112.
The previous prime is 3223110103. The next prime is 3223110119. The reversal of 3223110113 is 3110113223.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3054551824 + 168558289 = 55268^2 + 12983^2 .
It is a cyclic number.
It is not a de Polignac number, because 3223110113 - 214 = 3223093729 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3223110091 and 3223110100.
It is not a weakly prime, because it can be changed into another prime (3223110119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1611555056 + 1611555057.
It is an arithmetic number, because the mean of its divisors is an integer number (1611555057).
Almost surely, 23223110113 is an apocalyptic number.
It is an amenable number.
3223110113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3223110113 is an equidigital number, since it uses as much as digits as its factorization.
3223110113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 3223110113 is about 56772.4414923297. The cubic root of 3223110113 is about 1477.1515264843.
Adding to 3223110113 its reverse (3110113223), we get a palindrome (6333223336).
It can be divided in two parts, 3223110 and 113, that added together give a palindrome (3223223).
The spelling of 3223110113 in words is "three billion, two hundred twenty-three million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •