Base | Representation |
---|---|
bin | 1100111111010001010… |
… | …1011111011010110001 |
3 | 210022222012011220102222 |
4 | 3033310111133122301 |
5 | 12123444001402023 |
6 | 250302120250425 |
7 | 22056452601011 |
oct | 3176425373261 |
9 | 708865156388 |
10 | 223142606513 |
11 | 866a8202a92 |
12 | 372b6010a15 |
13 | 18071abbb98 |
14 | ab2b8d1c41 |
15 | 5c10052cc8 |
hex | 33f455f6b1 |
223142606513 has 2 divisors, whose sum is σ = 223142606514. Its totient is φ = 223142606512.
The previous prime is 223142606483. The next prime is 223142606563. The reversal of 223142606513 is 315606241322.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 116985889024 + 106156717489 = 342032^2 + 325817^2 .
It is a cyclic number.
It is not a de Polignac number, because 223142606513 - 214 = 223142590129 is a prime.
It is a super-3 number, since 3×2231426065133 (a number of 35 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (223142606563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111571303256 + 111571303257.
It is an arithmetic number, because the mean of its divisors is an integer number (111571303257).
Almost surely, 2223142606513 is an apocalyptic number.
It is an amenable number.
223142606513 is a deficient number, since it is larger than the sum of its proper divisors (1).
223142606513 is an equidigital number, since it uses as much as digits as its factorization.
223142606513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 35.
Adding to 223142606513 its reverse (315606241322), we get a palindrome (538748847835).
The spelling of 223142606513 in words is "two hundred twenty-three billion, one hundred forty-two million, six hundred six thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •