Base | Representation |
---|---|
bin | 1010011101101001110000… |
… | …1010011100111100000001 |
3 | 1111201211020100012102220012 |
4 | 2213122130022130330001 |
5 | 3001442300323414403 |
6 | 40245040330154305 |
7 | 2265114166644245 |
oct | 247323412347401 |
9 | 44654210172805 |
10 | 11504542404353 |
11 | 373605a29aa99 |
12 | 13597a7b82995 |
13 | 655b4867464b |
14 | 2bab73b82425 |
15 | 14e3d5ea4ed8 |
hex | a769c29cf01 |
11504542404353 has 2 divisors, whose sum is σ = 11504542404354. Its totient is φ = 11504542404352.
The previous prime is 11504542404283. The next prime is 11504542404403. The reversal of 11504542404353 is 35340424540511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9317432687809 + 2187109716544 = 3052447^2 + 1478888^2 .
It is a cyclic number.
It is not a de Polignac number, because 11504542404353 - 212 = 11504542400257 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11504542404353.
It is not a weakly prime, because it can be changed into another prime (11504542407353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5752271202176 + 5752271202177.
It is an arithmetic number, because the mean of its divisors is an integer number (5752271202177).
Almost surely, 211504542404353 is an apocalyptic number.
It is an amenable number.
11504542404353 is a deficient number, since it is larger than the sum of its proper divisors (1).
11504542404353 is an equidigital number, since it uses as much as digits as its factorization.
11504542404353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576000, while the sum is 41.
Adding to 11504542404353 its reverse (35340424540511), we get a palindrome (46844966944864).
The spelling of 11504542404353 in words is "eleven trillion, five hundred four billion, five hundred forty-two million, four hundred four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •