Base | Representation |
---|---|
bin | 11010100101011… |
… | …10000011000101 |
3 | 120112122010121011 |
4 | 31102232003011 |
5 | 424042323023 |
6 | 34043522221 |
7 | 5345363611 |
oct | 1522560305 |
9 | 515563534 |
10 | 223011013 |
11 | 10497a525 |
12 | 62829371 |
13 | 372830a4 |
14 | 21892341 |
15 | 148a250d |
hex | d4ae0c5 |
223011013 has 16 divisors (see below), whose sum is σ = 239936256. Its totient is φ = 206757760.
The previous prime is 223011007. The next prime is 223011017. The reversal of 223011013 is 310110322.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-223011013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 223010984 and 223011002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223011017) 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 in 15 ways as a sum of consecutive naturals, for example, 162456 + ... + 163822.
It is an arithmetic number, because the mean of its divisors is an integer number (14996016).
Almost surely, 2223011013 is an apocalyptic number.
223011013 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
223011013 is a deficient number, since it is larger than the sum of its proper divisors (16925243).
223011013 is a wasteful number, since it uses less digits than its factorization.
223011013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1604.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 223011013 is about 14933.5532610293. The cubic root of 223011013 is about 606.4226819815.
Adding to 223011013 its reverse (310110322), we get a palindrome (533121335).
The spelling of 223011013 in words is "two hundred twenty-three million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •