Base | Representation |
---|---|
bin | 1010001100000111001011… |
… | …1011111000111000110111 |
3 | 1110200000102110222010122122 |
4 | 2203001302323320320313 |
5 | 2432023124432310403 |
6 | 35454402545150155 |
7 | 2234255546235236 |
oct | 243016273707067 |
9 | 43600373863578 |
10 | 11203203010103 |
11 | 362a285039aa5 |
12 | 130b30a02b35b |
13 | 6335c41c6b80 |
14 | 2aa348bc6b1d |
15 | 14664ae23838 |
hex | a3072ef8e37 |
11203203010103 has 8 divisors (see below), whose sum is σ = 12145960932000. Its totient is φ = 10272012670368.
The previous prime is 11203203010099. The next prime is 11203203010151. The reversal of 11203203010103 is 30101030230211.
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 11203203010103 - 22 = 11203203010099 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 (11203203010003) 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, 2891893523 + ... + 2891897396.
It is an arithmetic number, because the mean of its divisors is an integer number (1518245116500).
Almost surely, 211203203010103 is an apocalyptic number.
11203203010103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11203203010103 is a deficient number, since it is larger than the sum of its proper divisors (942757921897).
11203203010103 is a wasteful number, since it uses less digits than its factorization.
11203203010103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5783791081.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 11203203010103 its reverse (30101030230211), we get a palindrome (41304233240314).
The spelling of 11203203010103 in words is "eleven trillion, two hundred three billion, two hundred three million, ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •