Base | Representation |
---|---|
bin | 11010100110100… |
… | …11010001000101 |
3 | 120112220212201101 |
4 | 31103103101011 |
5 | 424112212321 |
6 | 34051100101 |
7 | 5346600223 |
oct | 1523232105 |
9 | 515825641 |
10 | 223163461 |
11 | 104a74014 |
12 | 628a1631 |
13 | 373075b1 |
14 | 218d1b13 |
15 | 148d2791 |
hex | d4d3445 |
223163461 has 2 divisors, whose sum is σ = 223163462. Its totient is φ = 223163460.
The previous prime is 223163453. The next prime is 223163489. The reversal of 223163461 is 164361322.
It is an a-pointer prime, because the next prime (223163489) can be obtained adding 223163461 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 213335236 + 9828225 = 14606^2 + 3135^2 .
It is a cyclic number.
It is not a de Polignac number, because 223163461 - 23 = 223163453 is a prime.
It is a super-3 number, since 3×2231634613 (a number of 26 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (223163441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111581730 + 111581731.
It is an arithmetic number, because the mean of its divisors is an integer number (111581731).
Almost surely, 2223163461 is an apocalyptic number.
It is an amenable number.
223163461 is a deficient number, since it is larger than the sum of its proper divisors (1).
223163461 is an equidigital number, since it uses as much as digits as its factorization.
223163461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5184, while the sum is 28.
The square root of 223163461 is about 14938.6565995741. The cubic root of 223163461 is about 606.5608319116.
The spelling of 223163461 in words is "two hundred twenty-three million, one hundred sixty-three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •