Base | Representation |
---|---|
bin | 110010101110100110011101… |
… | …010111010111101110010001 |
3 | 1002020221121021021122002021102 |
4 | 302232212131113113232101 |
5 | 213220321424340340423 |
6 | 2110300520341434145 |
7 | 64664532565653656 |
oct | 6256463527275621 |
9 | 1066847237562242 |
10 | 223104716340113 |
11 | 650a71a7056303 |
12 | 2103323210b955 |
13 | 97648b8a4462a |
14 | 3d1447c33bc2d |
15 | 1abd6eb977c28 |
hex | cae99d5d7b91 |
223104716340113 has 2 divisors, whose sum is σ = 223104716340114. Its totient is φ = 223104716340112.
The previous prime is 223104716340073. The next prime is 223104716340137. The reversal of 223104716340113 is 311043617401322.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 171826270495504 + 51278445844609 = 13108252^2 + 7160897^2 .
It is a cyclic number.
It is not a de Polignac number, because 223104716340113 - 226 = 223104649231249 is a prime.
It is a super-3 number, since 3×2231047163401133 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (223104716340193) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111552358170056 + 111552358170057.
It is an arithmetic number, because the mean of its divisors is an integer number (111552358170057).
Almost surely, 2223104716340113 is an apocalyptic number.
It is an amenable number.
223104716340113 is a deficient number, since it is larger than the sum of its proper divisors (1).
223104716340113 is an equidigital number, since it uses as much as digits as its factorization.
223104716340113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72576, while the sum is 38.
The spelling of 223104716340113 in words is "two hundred twenty-three trillion, one hundred four billion, seven hundred sixteen million, three hundred forty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •