Base | Representation |
---|---|
bin | 10101011011001101… |
… | …01110000100100101 |
3 | 1002200122001201211100 |
4 | 22231212232010211 |
5 | 142024122340031 |
6 | 5141215230313 |
7 | 555021001125 |
oct | 125546560445 |
9 | 32618051740 |
10 | 11502543141 |
11 | 4972981a01 |
12 | 2290218399 |
13 | 111409015b |
14 | 7b1928c85 |
15 | 474c5ade6 |
hex | 2ad9ae125 |
11502543141 has 24 divisors (see below), whose sum is σ = 16894740096. Its totient is φ = 7539265440.
The previous prime is 11502543109. The next prime is 11502543161. The reversal of 11502543141 is 14134520511.
11502543141 is a `hidden beast` number, since 11 + 502 + 5 + 4 + 3 + 141 = 666.
11502543141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11502543141 - 25 = 11502543109 is a prime.
It is a super-2 number, since 2×115025431412 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11502543161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1986136 + ... + 1991918.
It is an arithmetic number, because the mean of its divisors is an integer number (703947504).
Almost surely, 211502543141 is an apocalyptic number.
It is an amenable number.
11502543141 is a deficient number, since it is larger than the sum of its proper divisors (5392196955).
11502543141 is a wasteful number, since it uses less digits than its factorization.
11502543141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9473 (or 9470 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The spelling of 11502543141 in words is "eleven billion, five hundred two million, five hundred forty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •