Base | Representation |
---|---|
bin | 1010001110010001110000… |
… | …1011001100111011001011 |
3 | 1110210120102221122022112212 |
4 | 2203210130023030323023 |
5 | 2433130320420042303 |
6 | 35523434111055335 |
7 | 2240043433341035 |
oct | 243443413147313 |
9 | 43716387568485 |
10 | 11240402112203 |
11 | 3644033a56a90 |
12 | 131656bb1154b |
13 | 636c71bc65a4 |
14 | 2ac0773b8c55 |
15 | 1475c6a94ad8 |
hex | a391c2ccecb |
11240402112203 has 8 divisors (see below), whose sum is σ = 12523155932160. Its totient is φ = 10001131472680.
The previous prime is 11240402112179. The next prime is 11240402112209. The reversal of 11240402112203 is 30221120404211.
11240402112203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11240402112203 - 228 = 11240133676747 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11240402112209) 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, 10870794563 + ... + 10870795596.
It is an arithmetic number, because the mean of its divisors is an integer number (1565394491520).
Almost surely, 211240402112203 is an apocalyptic number.
11240402112203 is a deficient number, since it is larger than the sum of its proper divisors (1282753819957).
11240402112203 is a wasteful number, since it uses less digits than its factorization.
11240402112203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21741590217.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 11240402112203 its reverse (30221120404211), we get a palindrome (41461522516414).
The spelling of 11240402112203 in words is "eleven trillion, two hundred forty billion, four hundred two million, one hundred twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •