Base | Representation |
---|---|
bin | 1010001101000101110101… |
… | …1011010010100001100011 |
3 | 1110201121211121212221211221 |
4 | 2203101131123102201203 |
5 | 2432312101113341003 |
6 | 35510223522515511 |
7 | 2235422414343220 |
oct | 243213533224143 |
9 | 43647747787757 |
10 | 11220022012003 |
11 | 3636425a14072 |
12 | 1312622805b97 |
13 | 635074856cbc |
14 | 2ab0a282c947 |
15 | 146cd27967bd |
hex | a345d6d2863 |
11220022012003 has 8 divisors (see below), whose sum is σ = 12825260032608. Its totient is φ = 9615378424704.
The previous prime is 11220022011997. The next prime is 11220022012009. The reversal of 11220022012003 is 30021022002211.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (11220022011997) and next prime (11220022012009).
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 11220022012003 - 213 = 11220022003811 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11220022012009) 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, 148567876 + ... + 148643377.
It is an arithmetic number, because the mean of its divisors is an integer number (1603157504076).
Almost surely, 211220022012003 is an apocalyptic number.
11220022012003 is a deficient number, since it is larger than the sum of its proper divisors (1605238020605).
11220022012003 is an equidigital number, since it uses as much as digits as its factorization.
11220022012003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297216653.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 11220022012003 its reverse (30021022002211), we get a palindrome (41241044014214).
The spelling of 11220022012003 in words is "eleven trillion, two hundred twenty billion, twenty-two million, twelve thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •