Base | Representation |
---|---|
bin | 1010011110001111011011… |
… | …1100110110101101010101 |
3 | 1111202210100010202222122111 |
4 | 2213203312330312231111 |
5 | 3002124003302014031 |
6 | 40253432033031021 |
7 | 2265622616566402 |
oct | 247436674665525 |
9 | 44683303688574 |
10 | 11514655501141 |
11 | 373a379931321 |
12 | 135b74a9b5471 |
13 | 656a9a90c8a0 |
14 | 2bb452d452a9 |
15 | 14e7c8c531b1 |
hex | a78f6f36b55 |
11514655501141 has 32 divisors (see below), whose sum is σ = 12651208770816. Its totient is φ = 10415321280000.
The previous prime is 11514655501133. The next prime is 11514655501171. The reversal of 11514655501141 is 14110555641511.
It is not a de Polignac number, because 11514655501141 - 23 = 11514655501133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11514655501094 and 11514655501103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11514655501171) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 225969216 + ... + 226020166.
It is an arithmetic number, because the mean of its divisors is an integer number (395350274088).
Almost surely, 211514655501141 is an apocalyptic number.
It is an amenable number.
11514655501141 is a deficient number, since it is larger than the sum of its proper divisors (1136553269675).
11514655501141 is a wasteful number, since it uses less digits than its factorization.
11514655501141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52093.
The product of its (nonzero) digits is 60000, while the sum is 40.
The spelling of 11514655501141 in words is "eleven trillion, five hundred fourteen billion, six hundred fifty-five million, five hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •