Base | Representation |
---|---|
bin | 1010001100000110011011… |
… | …1101110111100010111101 |
3 | 1110122222220111010001010122 |
4 | 2203001212331313202331 |
5 | 2432022222030433201 |
6 | 35454331013144325 |
7 | 2234250560344610 |
oct | 243014675674275 |
9 | 43588814101118 |
10 | 11203002202301 |
11 | 362a191755138 |
12 | 130b27292b0a5 |
13 | 633591718ca0 |
14 | 2aa32a274177 |
15 | 1466384a9e1b |
hex | a3066f778bd |
11203002202301 has 16 divisors (see below), whose sum is σ = 14263769385600. Its totient is φ = 8558261627328.
The previous prime is 11203002202087. The next prime is 11203002202331. The reversal of 11203002202301 is 10320220030211.
It is not a de Polignac number, because 11203002202301 - 222 = 11202998007997 is a prime.
It is a super-2 number, since 2×112030022023012 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11203002202301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11203002202331) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2122582091 + ... + 2122587368.
It is an arithmetic number, because the mean of its divisors is an integer number (891485586600).
Almost surely, 211203002202301 is an apocalyptic number.
It is an amenable number.
11203002202301 is a deficient number, since it is larger than the sum of its proper divisors (3060767183299).
11203002202301 is a wasteful number, since it uses less digits than its factorization.
11203002202301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4245169508.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 11203002202301 its reverse (10320220030211), we get a palindrome (21523222232512).
The spelling of 11203002202301 in words is "eleven trillion, two hundred three billion, two million, two hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •