Base | Representation |
---|---|
bin | 1010000111011101100100… |
… | …0000110110111011100101 |
3 | 1110101101012200110012022011 |
4 | 2201313121000312323211 |
5 | 2424221020132211323 |
6 | 35353551214434221 |
7 | 2225430010160656 |
oct | 241673100667345 |
9 | 43341180405264 |
10 | 11123311210213 |
11 | 35a94082152a4 |
12 | 12b7932502971 |
13 | 628c016170b7 |
14 | 2a652a57552d |
15 | 1445221c920d |
hex | a1dd9036ee5 |
11123311210213 has 8 divisors (see below), whose sum is σ = 11607078184128. Its totient is φ = 10639556298624.
The previous prime is 11123311210111. The next prime is 11123311210309. The reversal of 11123311210213 is 31201211332111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11123311210213 - 29 = 11123311209701 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 (11123321210213) 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, 1105420 + ... + 4844437.
It is an arithmetic number, because the mean of its divisors is an integer number (1450884773016).
Almost surely, 211123311210213 is an apocalyptic number.
It is an amenable number.
11123311210213 is a deficient number, since it is larger than the sum of its proper divisors (483766973915).
11123311210213 is an equidigital number, since it uses as much as digits as its factorization.
11123311210213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6031163.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 11123311210213 its reverse (31201211332111), we get a palindrome (42324522542324).
The spelling of 11123311210213 in words is "eleven trillion, one hundred twenty-three billion, three hundred eleven million, two hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •