Base | Representation |
---|---|
bin | 1100111111010110100… |
… | …1000011110100011100 |
3 | 210100000201101220021020 |
4 | 3033311221003310130 |
5 | 12124020103413224 |
6 | 250304222004140 |
7 | 22060140031656 |
oct | 3176551036434 |
9 | 710021356236 |
10 | 223164513564 |
11 | 86709606093 |
12 | 37301416650 |
13 | 180764bc335 |
14 | ab307956d6 |
15 | 5c11e2dc79 |
hex | 33f5a43d1c |
223164513564 has 12 divisors (see below), whose sum is σ = 520717198344. Its totient is φ = 74388171184.
The previous prime is 223164513541. The next prime is 223164513569. The reversal of 223164513564 is 465315461322.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-3 number, since 3×2231645135643 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223164513569) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9298521387 + ... + 9298521410.
It is an arithmetic number, because the mean of its divisors is an integer number (43393099862).
Almost surely, 2223164513564 is an apocalyptic number.
It is an amenable number.
223164513564 is an abundant number, since it is smaller than the sum of its proper divisors (297552684780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
223164513564 is a wasteful number, since it uses less digits than its factorization.
223164513564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18597042804 (or 18597042802 counting only the distinct ones).
The product of its digits is 518400, while the sum is 42.
Adding to 223164513564 its reverse (465315461322), we get a palindrome (688479974886).
The spelling of 223164513564 in words is "two hundred twenty-three billion, one hundred sixty-four million, five hundred thirteen thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •