Base | Representation |
---|---|
bin | 1010000010100111100101… |
… | …1010110001111110111101 |
3 | 1110002102102202112212220120 |
4 | 2200221321122301332331 |
5 | 2421340112332424313 |
6 | 35251430414205153 |
7 | 2216423021162421 |
oct | 240517132617675 |
9 | 43072382485816 |
10 | 11040103014333 |
11 | 3577099378168 |
12 | 12a37901b37b9 |
13 | 621100934133 |
14 | 2a24b56bab81 |
15 | 1422a223dd23 |
hex | a0a796b1fbd |
11040103014333 has 4 divisors (see below), whose sum is σ = 14720137352448. Its totient is φ = 7360068676220.
The previous prime is 11040103014323. The next prime is 11040103014373. The reversal of 11040103014333 is 33341030104011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11040103014333 - 25 = 11040103014301 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11040103014323) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1840017169053 + ... + 1840017169058.
It is an arithmetic number, because the mean of its divisors is an integer number (3680034338112).
Almost surely, 211040103014333 is an apocalyptic number.
It is an amenable number.
11040103014333 is a deficient number, since it is larger than the sum of its proper divisors (3680034338115).
11040103014333 is an equidigital number, since it uses as much as digits as its factorization.
11040103014333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3680034338114.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 11040103014333 its reverse (33341030104011), we get a palindrome (44381133118344).
The spelling of 11040103014333 in words is "eleven trillion, forty billion, one hundred three million, fourteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •