Base | Representation |
---|---|
bin | 110010110001101000100011… |
… | …011000100010000111111101 |
3 | 1002021200112012111221121201010 |
4 | 302301220203120202013331 |
5 | 213232230234021101023 |
6 | 2110540344344305433 |
7 | 65015561241144516 |
oct | 6261504330420775 |
9 | 1067615174847633 |
10 | 223313123222013 |
11 | 65177622330290 |
12 | 210676b5172279 |
13 | 977b44c987726 |
14 | 3d205acb5da0d |
15 | 1ac3d47eba093 |
hex | cb1a236221fd |
223313123222013 has 32 divisors (see below), whose sum is σ = 339282074327040. Its totient is φ = 129405662850240.
The previous prime is 223313123221963. The next prime is 223313123222039. The reversal of 223313123222013 is 310222321313322.
It is not a de Polignac number, because 223313123222013 - 216 = 223313123156477 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (223313123220013) 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 31 ways as a sum of consecutive naturals, for example, 1132654081 + ... + 1132851222.
It is an arithmetic number, because the mean of its divisors is an integer number (10602564822720).
Almost surely, 2223313123222013 is an apocalyptic number.
It is an amenable number.
223313123222013 is a deficient number, since it is larger than the sum of its proper divisors (115968951105027).
223313123222013 is a wasteful number, since it uses less digits than its factorization.
223313123222013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2265505449.
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 223313123222013 its reverse (310222321313322), we get a palindrome (533535444535335).
The spelling of 223313123222013 in words is "two hundred twenty-three trillion, three hundred thirteen billion, one hundred twenty-three million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •