Base | Representation |
---|---|
bin | 1010000110010001111100… |
… | …0101111010001101111001 |
3 | 1110022102211000002201010201 |
4 | 2201210133011322031321 |
5 | 2423402432044244113 |
6 | 35340353042242201 |
7 | 2224110663463324 |
oct | 241443705721571 |
9 | 43272730081121 |
10 | 11103012103033 |
11 | 35a0840971664 |
12 | 12b3a08356361 |
13 | 627017c94b86 |
14 | 2a556266d7bb |
15 | 143c35078cdd |
hex | a191f17a379 |
11103012103033 has 16 divisors (see below), whose sum is σ = 11653223368192. Its totient is φ = 10564929792000.
The previous prime is 11103012103021. The next prime is 11103012103093. The reversal of 11103012103033 is 33030121030111.
It is a cyclic number.
It is not a de Polignac number, because 11103012103033 - 221 = 11103010005881 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11103012103033.
It is not an unprimeable number, because it can be changed into a prime (11103012103093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4253113 + ... + 6347833.
It is an arithmetic number, because the mean of its divisors is an integer number (728326460512).
Almost surely, 211103012103033 is an apocalyptic number.
It is an amenable number.
11103012103033 is a deficient number, since it is larger than the sum of its proper divisors (550211265159).
11103012103033 is a wasteful number, since it uses less digits than its factorization.
11103012103033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2097616.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 11103012103033 its reverse (33030121030111), we get a palindrome (44133133133144).
The spelling of 11103012103033 in words is "eleven trillion, one hundred three billion, twelve million, one hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •