Base | Representation |
---|---|
bin | 1010001100101100111011… |
… | …0000000000010001101111 |
3 | 1110200222120110221212022210 |
4 | 2203023032300000101233 |
5 | 2432204401313124403 |
6 | 35503200105141503 |
7 | 2235064565454516 |
oct | 243131660002157 |
9 | 43628513855283 |
10 | 11213333333103 |
11 | 3633603376670 |
12 | 131127678a893 |
13 | 634549bb3b35 |
14 | 2aaa2a39167d |
15 | 146a40475b03 |
hex | a32cec0046f |
11213333333103 has 8 divisors (see below), whose sum is σ = 16310303030016. Its totient is φ = 6795959595800.
The previous prime is 11213333333047. The next prime is 11213333333123. The reversal of 11213333333103 is 30133333331211.
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 11213333333103 - 28 = 11213333332847 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11213333333123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 169898989863 + ... + 169898989928.
It is an arithmetic number, because the mean of its divisors is an integer number (2038787878752).
Almost surely, 211213333333103 is an apocalyptic number.
11213333333103 is a deficient number, since it is larger than the sum of its proper divisors (5096969696913).
11213333333103 is a wasteful number, since it uses less digits than its factorization.
11213333333103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339797979805.
The product of its (nonzero) digits is 13122, while the sum is 30.
Adding to 11213333333103 its reverse (30133333331211), we get a palindrome (41346666664314).
The spelling of 11213333333103 in words is "eleven trillion, two hundred thirteen billion, three hundred thirty-three million, three hundred thirty-three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •