Base | Representation |
---|---|
bin | 1010000001100000110110… |
… | …0010011001001010010111 |
3 | 1110000121102022212102200001 |
4 | 2200120031202121022113 |
5 | 2421032214434420203 |
6 | 35235010212432131 |
7 | 2215151313345142 |
oct | 240301542311227 |
9 | 43017368772601 |
10 | 11021113201303 |
11 | 356a03409a607 |
12 | 129bb70618647 |
13 | 61c39562238a |
14 | 2a15d3635059 |
15 | 141a4001791d |
hex | a060d899297 |
11021113201303 has 8 divisors (see below), whose sum is σ = 11050746491600. Its totient is φ = 10991482826688.
The previous prime is 11021113201289. The next prime is 11021113201309. The reversal of 11021113201303 is 30310231112011.
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 11021113201303 - 25 = 11021113201271 is a prime.
It is a super-2 number, since 2×110211132013032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021113201309) 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, 6949693 + ... + 8386921.
It is an arithmetic number, because the mean of its divisors is an integer number (1381343311450).
Almost surely, 211021113201303 is an apocalyptic number.
11021113201303 is a deficient number, since it is larger than the sum of its proper divisors (29633290297).
11021113201303 is a wasteful number, since it uses less digits than its factorization.
11021113201303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1457841.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 11021113201303 its reverse (30310231112011), we get a palindrome (41331344313314).
The spelling of 11021113201303 in words is "eleven trillion, twenty-one billion, one hundred thirteen million, two hundred one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •