Base | Representation |
---|---|
bin | 1010001101010010001010… |
… | …0111000100000011011101 |
3 | 1110201221101011211211101011 |
4 | 2203110202213010003131 |
5 | 2432340340013210023 |
6 | 35511532101015221 |
7 | 2235600404511325 |
oct | 243244247040335 |
9 | 43657334754334 |
10 | 11223330210013 |
11 | 3637873348209 |
12 | 13131a66b4511 |
13 | 63548104990c |
14 | 2ab2d7d40285 |
15 | 146e27e1850d |
hex | a35229c40dd |
11223330210013 has 8 divisors (see below), whose sum is σ = 11421525260288. Its totient is φ = 11026851134544.
The previous prime is 11223330209963. The next prime is 11223330210073. The reversal of 11223330210013 is 31001203332211.
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 11223330210013 - 221 = 11223328112861 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11223330210073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 428980506 + ... + 429006667.
It is an arithmetic number, because the mean of its divisors is an integer number (1427690657536).
Almost surely, 211223330210013 is an apocalyptic number.
It is an amenable number.
11223330210013 is a deficient number, since it is larger than the sum of its proper divisors (198195050275).
11223330210013 is a wasteful number, since it uses less digits than its factorization.
11223330210013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 857987403.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 11223330210013 its reverse (31001203332211), we get a palindrome (42224533542224).
The spelling of 11223330210013 in words is "eleven trillion, two hundred twenty-three billion, three hundred thirty million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •