Base | Representation |
---|---|
bin | 1010001100000110011110… |
… | …0011101101111000110001 |
3 | 1110122222221011210010102201 |
4 | 2203001213203231320301 |
5 | 2432022232100433314 |
6 | 35454332005543201 |
7 | 2234251040600503 |
oct | 243014743557061 |
9 | 43588834703381 |
10 | 11203012124209 |
11 | 362a197311664 |
12 | 130b276114b01 |
13 | 6335937b1139 |
14 | 2aa32b6d7d73 |
15 | 1466392b9b74 |
hex | a30678ede31 |
11203012124209 has 4 divisors (see below), whose sum is σ = 11220435160816. Its totient is φ = 11185589087604.
The previous prime is 11203012124141. The next prime is 11203012124231. The reversal of 11203012124209 is 90242121030211.
11203012124209 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11203012124209 - 211 = 11203012122161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11203012124509) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8711517339 + ... + 8711518624.
It is an arithmetic number, because the mean of its divisors is an integer number (2805108790204).
Almost surely, 211203012124209 is an apocalyptic number.
It is an amenable number.
11203012124209 is a deficient number, since it is larger than the sum of its proper divisors (17423036607).
11203012124209 is an equidigital number, since it uses as much as digits as its factorization.
11203012124209 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17423036606.
The product of its (nonzero) digits is 1728, while the sum is 28.
The spelling of 11203012124209 in words is "eleven trillion, two hundred three billion, twelve million, one hundred twenty-four thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •