Base | Representation |
---|---|
bin | 1010001000110000010011… |
… | …1101010110010011101101 |
3 | 1110110111112200110111101101 |
4 | 2202030010331112103231 |
5 | 2430102012432333031 |
6 | 35412103245243101 |
7 | 2230144313056423 |
oct | 242140475262355 |
9 | 43414480414341 |
10 | 11145523324141 |
11 | 3607876398248 |
12 | 13000b1263491 |
13 | 62b0313a518b |
14 | 2a763656d113 |
15 | 144dc2256361 |
hex | a2304f564ed |
11145523324141 has 16 divisors (see below), whose sum is σ = 11210136409600. Its totient is φ = 11081058847488.
The previous prime is 11145523324127. The next prime is 11145523324217. The reversal of 11145523324141 is 14142332554111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11145523324141 - 215 = 11145523291373 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11145523324141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11145523324121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 611609356 + ... + 611627578.
It is an arithmetic number, because the mean of its divisors is an integer number (700633525600).
Almost surely, 211145523324141 is an apocalyptic number.
It is an amenable number.
11145523324141 is a deficient number, since it is larger than the sum of its proper divisors (64613085459).
11145523324141 is a wasteful number, since it uses less digits than its factorization.
11145523324141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22108.
The product of its digits is 57600, while the sum is 37.
Adding to 11145523324141 its reverse (14142332554111), we get a palindrome (25287855878252).
The spelling of 11145523324141 in words is "eleven trillion, one hundred forty-five billion, five hundred twenty-three million, three hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •