Base | Representation |
---|---|
bin | 11010100101100… |
… | …00010001010001 |
3 | 120112122121002012 |
4 | 31102300101101 |
5 | 424043120423 |
6 | 34044032305 |
7 | 5345432261 |
oct | 1522602121 |
9 | 515577065 |
10 | 223020113 |
11 | 104986348 |
12 | 62832695 |
13 | 37287284 |
14 | 218957a1 |
15 | 148a5078 |
hex | d4b0451 |
223020113 has 4 divisors (see below), whose sum is σ = 223508580. Its totient is φ = 222531648.
The previous prime is 223020097. The next prime is 223020143. The reversal of 223020113 is 311020322.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 79691329 + 143328784 = 8927^2 + 11972^2 .
It is a cyclic number.
It is not a de Polignac number, because 223020113 - 24 = 223020097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (223020143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 243548 + ... + 244461.
It is an arithmetic number, because the mean of its divisors is an integer number (55877145).
Almost surely, 2223020113 is an apocalyptic number.
It is an amenable number.
223020113 is a deficient number, since it is larger than the sum of its proper divisors (488467).
223020113 is an equidigital number, since it uses as much as digits as its factorization.
223020113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488466.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 223020113 is about 14933.8579409341. The cubic root of 223020113 is about 606.4309302608.
Adding to 223020113 its reverse (311020322), we get a palindrome (534040435).
The spelling of 223020113 in words is "two hundred twenty-three million, twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •