Base | Representation |
---|---|
bin | 1100111111100001101… |
… | …1001111010000000111 |
3 | 210100010222021221020011 |
4 | 3033320123033100013 |
5 | 12124114033101043 |
6 | 250313011051051 |
7 | 22061245040146 |
oct | 3177033172007 |
9 | 710128257204 |
10 | 223211222023 |
11 | 86732a08919 |
12 | 37314ba0a87 |
13 | 1808309448a |
14 | ab36a7375d |
15 | 5c160a859d |
hex | 33f86cf407 |
223211222023 has 8 divisors (see below), whose sum is σ = 227437927488. Its totient is φ = 218985078624.
The previous prime is 223211221967. The next prime is 223211222099. The reversal of 223211222023 is 320222112322.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-223211222023 is a prime.
It is a super-3 number, since 3×2232112220233 (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 = 223211221985 and 223211222003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223211222323) 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, 709465 + ... + 974557.
It is an arithmetic number, because the mean of its divisors is an integer number (28429740936).
Almost surely, 2223211222023 is an apocalyptic number.
223211222023 is a deficient number, since it is larger than the sum of its proper divisors (4226705465).
223211222023 is a wasteful number, since it uses less digits than its factorization.
223211222023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281033.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 223211222023 its reverse (320222112322), we get a palindrome (543433334345).
The spelling of 223211222023 in words is "two hundred twenty-three billion, two hundred eleven million, two hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •