Base | Representation |
---|---|
bin | 1100111111000111101… |
… | …1011101111011001111 |
3 | 210022212101012120120211 |
4 | 3033301323131323033 |
5 | 12123403132331343 |
6 | 250254115023251 |
7 | 22055452444615 |
oct | 3176173357317 |
9 | 708771176524 |
10 | 223102230223 |
11 | 86687435754 |
12 | 372a459ab27 |
13 | 18066622ca2 |
14 | ab263c16b5 |
15 | 5c0b72979d |
hex | 33f1eddecf |
223102230223 has 8 divisors (see below), whose sum is σ = 223660602000. Its totient is φ = 222544132608.
The previous prime is 223102230161. The next prime is 223102230227. The reversal of 223102230223 is 322032201322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 223102230223 - 233 = 214512295631 is a prime.
It is a super-3 number, since 3×2231022302233 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 223102230194 and 223102230203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223102230227) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1612365 + ... + 1745257.
It is an arithmetic number, because the mean of its divisors is an integer number (27957575250).
Almost surely, 2223102230223 is an apocalyptic number.
223102230223 is a deficient number, since it is larger than the sum of its proper divisors (558371777).
223102230223 is a wasteful number, since it uses less digits than its factorization.
223102230223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137081.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 223102230223 its reverse (322032201322), we get a palindrome (545134431545).
The spelling of 223102230223 in words is "two hundred twenty-three billion, one hundred two million, two hundred thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •