Base | Representation |
---|---|
bin | 1010000110010010101001… |
… | …0111010010111011110111 |
3 | 1110022110022011221100021021 |
4 | 2201210222113102323313 |
5 | 2423403324002210403 |
6 | 35340423515402011 |
7 | 2224115451042022 |
oct | 241445227227367 |
9 | 43273264840237 |
10 | 11103201210103 |
11 | 35a09286945a2 |
12 | 12b3a5b753307 |
13 | 627048207052 |
14 | 2a557d8181b9 |
15 | 143c469808bd |
hex | a192a5d2ef7 |
11103201210103 has 8 divisors (see below), whose sum is σ = 11231722070816. Its totient is φ = 10975078864800.
The previous prime is 11103201210071. The next prime is 11103201210139. The reversal of 11103201210103 is 30101210230111.
It is a happy number.
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 11103201210103 - 25 = 11103201210071 is a prime.
It is a super-2 number, since 2×111032012101032 (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 (11103201210403) 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, 99572808 + ... + 99684253.
It is an arithmetic number, because the mean of its divisors is an integer number (1403965258852).
Almost surely, 211103201210103 is an apocalyptic number.
11103201210103 is a deficient number, since it is larger than the sum of its proper divisors (128520860713).
11103201210103 is a wasteful number, since it uses less digits than its factorization.
11103201210103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 199257705.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 11103201210103 its reverse (30101210230111), we get a palindrome (41204411440214).
The spelling of 11103201210103 in words is "eleven trillion, one hundred three billion, two hundred one million, two hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •