Base | Representation |
---|---|
bin | 110010101101001110010111… |
… | …101001010100011000101011 |
3 | 1002020121120010110211002212122 |
4 | 302231032113221110120223 |
5 | 213212244222030214402 |
6 | 2110145235003501455 |
7 | 64654643641464011 |
oct | 6255162751243053 |
9 | 1066546113732778 |
10 | 223010131101227 |
11 | 6507007a165398 |
12 | 21018a3582788b |
13 | 97589c3ca2a62 |
14 | 3d0da684a68b1 |
15 | 1abb012cc1ca2 |
hex | cad397a5462b |
223010131101227 has 2 divisors, whose sum is σ = 223010131101228. Its totient is φ = 223010131101226.
The previous prime is 223010131101209. The next prime is 223010131101253. The reversal of 223010131101227 is 722101131010322.
It is an a-pointer prime, because the next prime (223010131101253) can be obtained adding 223010131101227 to its sum of digits (26).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 223010131101227 - 244 = 205417945056811 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 223010131101196 and 223010131101205.
It is not a weakly prime, because it can be changed into another prime (223010131301227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111505065550613 + 111505065550614.
It is an arithmetic number, because the mean of its divisors is an integer number (111505065550614).
Almost surely, 2223010131101227 is an apocalyptic number.
223010131101227 is a deficient number, since it is larger than the sum of its proper divisors (1).
223010131101227 is an equidigital number, since it uses as much as digits as its factorization.
223010131101227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 26.
Adding to 223010131101227 its reverse (722101131010322), we get a palindrome (945111262111549).
The spelling of 223010131101227 in words is "two hundred twenty-three trillion, ten billion, one hundred thirty-one million, one hundred one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •