Base | Representation |
---|---|
bin | 1010000010101011011000… |
… | …0011100101000110100001 |
3 | 1110002112001122211111201002 |
4 | 2200222312003211012201 |
5 | 2421344203301424213 |
6 | 35252115355121345 |
7 | 2216460153263516 |
oct | 240526603450641 |
9 | 43075048744632 |
10 | 11041120342433 |
11 | 3577570656895 |
12 | 12a3a14a43255 |
13 | 62123362a51c |
14 | 2a257085930d |
15 | 1423116e4658 |
hex | a0ab60e51a1 |
11041120342433 has 8 divisors (see below), whose sum is σ = 11045753312256. Its totient is φ = 11036487791200.
The previous prime is 11041120342429. The next prime is 11041120342477. The reversal of 11041120342433 is 33424302114011.
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 11041120342433 - 22 = 11041120342429 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11041120342396 and 11041120342405.
It is not an unprimeable number, because it can be changed into a prime (11041120342423) 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, 59747648 + ... + 59932158.
It is an arithmetic number, because the mean of its divisors is an integer number (1380719164032).
Almost surely, 211041120342433 is an apocalyptic number.
It is an amenable number.
11041120342433 is a deficient number, since it is larger than the sum of its proper divisors (4632969823).
11041120342433 is a wasteful number, since it uses less digits than its factorization.
11041120342433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 209295.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 11041120342433 its reverse (33424302114011), we get a palindrome (44465422456444).
The spelling of 11041120342433 in words is "eleven trillion, forty-one billion, one hundred twenty million, three hundred forty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •