Base | Representation |
---|---|
bin | 1010000001000011000010… |
… | …1100111001001101110011 |
3 | 1102222211202210111101011102 |
4 | 2200100300230321031303 |
5 | 2420414323441101003 |
6 | 35231204313235015 |
7 | 2214446132552264 |
oct | 240206054711563 |
9 | 42884683441142 |
10 | 11013113222003 |
11 | 35666a9336772 |
12 | 129a4b9402a6b |
13 | 61b6bc0b8809 |
14 | 2a1074d7496b |
15 | 141722a23588 |
hex | a0430b39373 |
11013113222003 has 4 divisors (see below), whose sum is σ = 11177488046280. Its totient is φ = 10848738397728.
The previous prime is 11013113221939. The next prime is 11013113222077. The reversal of 11013113222003 is 30022231131011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11013113222003 - 26 = 11013113221939 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11013113222803) 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 3 ways as a sum of consecutive naturals, for example, 82187412038 + ... + 82187412171.
It is an arithmetic number, because the mean of its divisors is an integer number (2794372011570).
Almost surely, 211013113222003 is an apocalyptic number.
11013113222003 is a deficient number, since it is larger than the sum of its proper divisors (164374824277).
11013113222003 is an equidigital number, since it uses as much as digits as its factorization.
11013113222003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164374824276.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 11013113222003 its reverse (30022231131011), we get a palindrome (41035344353014).
The spelling of 11013113222003 in words is "eleven trillion, thirteen billion, one hundred thirteen million, two hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •