Base | Representation |
---|---|
bin | 1010000010100111101100… |
… | …1101101101100111111001 |
3 | 1110002102111212020120201100 |
4 | 2200221323031231213321 |
5 | 2421340143041034113 |
6 | 35251433412042013 |
7 | 2216423535235251 |
oct | 240517315554771 |
9 | 43072455216640 |
10 | 11040133143033 |
11 | 3577104386315 |
12 | 12a379a303309 |
13 | 621106c52877 |
14 | 2a24b96c0961 |
15 | 1422a4be0d73 |
hex | a0a7b36d9f9 |
11040133143033 has 48 divisors (see below), whose sum is σ = 17776174852800. Its totient is φ = 6561601136640.
The previous prime is 11040133143031. The next prime is 11040133143037. The reversal of 11040133143033 is 33034133104011.
11040133143033 is a `hidden beast` number, since 1 + 1 + 0 + 40 + 1 + 3 + 314 + 303 + 3 = 666.
It is not a de Polignac number, because 11040133143033 - 21 = 11040133143031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11040133142988 and 11040133143006.
It is not an unprimeable number, because it can be changed into a prime (11040133143031) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 19962838 + ... + 20508416.
It is an arithmetic number, because the mean of its divisors is an integer number (370336976100).
Almost surely, 211040133143033 is an apocalyptic number.
It is an amenable number.
11040133143033 is a deficient number, since it is larger than the sum of its proper divisors (6736041709767).
11040133143033 is a wasteful number, since it uses less digits than its factorization.
11040133143033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552582 (or 552579 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 27.
Adding to 11040133143033 its reverse (33034133104011), we get a palindrome (44074266247044).
The spelling of 11040133143033 in words is "eleven trillion, forty billion, one hundred thirty-three million, one hundred forty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •