Base | Representation |
---|---|
bin | 1010001100101100011011… |
… | …1111101000001101011111 |
3 | 1110200222020102002222111110 |
4 | 2203023012333220031133 |
5 | 2432204120010223403 |
6 | 35503135140153103 |
7 | 2235061425445215 |
oct | 243130677501537 |
9 | 43628212088443 |
10 | 11213203211103 |
11 | 3633546981023 |
12 | 131123b098793 |
13 | 634528c5497a |
14 | 2aaa16d9ccb5 |
15 | 146a33d21103 |
hex | a32c6fe835f |
11213203211103 has 8 divisors (see below), whose sum is σ = 15161514201216. Its totient is φ = 7370180514200.
The previous prime is 11213203211101. The next prime is 11213203211107. The reversal of 11213203211103 is 30111230231211.
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 11213203211103 - 21 = 11213203211101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11213203211103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11213203211101) 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, 26322073053 + ... + 26322073478.
It is an arithmetic number, because the mean of its divisors is an integer number (1895189275152).
Almost surely, 211213203211103 is an apocalyptic number.
11213203211103 is a deficient number, since it is larger than the sum of its proper divisors (3948310990113).
11213203211103 is an equidigital number, since it uses as much as digits as its factorization.
11213203211103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52644146605.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 11213203211103 its reverse (30111230231211), we get a palindrome (41324433442314).
The spelling of 11213203211103 in words is "eleven trillion, two hundred thirteen billion, two hundred three million, two hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •