Base | Representation |
---|---|
bin | 1010000110010001111100… |
… | …0010100011000111111101 |
3 | 1110022102210221102221121100 |
4 | 2201210133002203013331 |
5 | 2423402431333101023 |
6 | 35340353011323313 |
7 | 2224110653133624 |
oct | 241443702430775 |
9 | 43272727387540 |
10 | 11103011222013 |
11 | 35a084041a747 |
12 | 12b3a07bb0539 |
13 | 627017a46b69 |
14 | 2a55624c06bb |
15 | 143c34e52c43 |
hex | a191f0a31fd |
11103011222013 has 12 divisors (see below), whose sum is σ = 16555027485568. Its totient is φ = 7163233046280.
The previous prime is 11103011221963. The next prime is 11103011222047. The reversal of 11103011222013 is 31022211030111.
11103011222013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11103011222013 - 29 = 11103011221501 is a prime.
It is a super-2 number, since 2×111030112220132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11103011022013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19897869295 + ... + 19897869852.
Almost surely, 211103011222013 is an apocalyptic number.
It is an amenable number.
11103011222013 is a deficient number, since it is larger than the sum of its proper divisors (5452016263555).
11103011222013 is a wasteful number, since it uses less digits than its factorization.
11103011222013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39795739184 (or 39795739181 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 11103011222013 its reverse (31022211030111), we get a palindrome (42125222252124).
The spelling of 11103011222013 in words is "eleven trillion, one hundred three billion, eleven million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •