Base | Representation |
---|---|
bin | 1100111110110001101… |
… | …1101100000001111111 |
3 | 210022121221200110202122 |
4 | 3033230123230001333 |
5 | 12123211030411221 |
6 | 250241022313155 |
7 | 22053252556631 |
oct | 3175433540177 |
9 | 708557613678 |
10 | 223010013311 |
11 | 8663a37a828 |
12 | 372797287bb |
13 | 180504a5c77 |
14 | ab18058a51 |
15 | 5c035b0eab |
hex | 33ec6ec07f |
223010013311 has 8 divisors (see below), whose sum is σ = 230810936400. Its totient is φ = 215216485120.
The previous prime is 223010013293. The next prime is 223010013341. The reversal of 223010013311 is 113310010322.
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 223010013311 - 210 = 223010012287 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 223010013311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223010013341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1787321 + ... + 1908018.
It is an arithmetic number, because the mean of its divisors is an integer number (28851367050).
Almost surely, 2223010013311 is an apocalyptic number.
223010013311 is a deficient number, since it is larger than the sum of its proper divisors (7800923089).
223010013311 is a wasteful number, since it uses less digits than its factorization.
223010013311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3697449.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 223010013311 its reverse (113310010322), we get a palindrome (336320023633).
The spelling of 223010013311 in words is "two hundred twenty-three billion, ten million, thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •