Base | Representation |
---|---|
bin | 1010100000000000101011… |
… | …1101110000110011100101 |
3 | 1111212200210210210002221020 |
4 | 2220000022331300303211 |
5 | 3003123233322221001 |
6 | 40315420414241353 |
7 | 2301050152203324 |
oct | 250001275606345 |
9 | 44780723702836 |
10 | 11545056054501 |
11 | 375125a188a92 |
12 | 1365613ab6259 |
13 | 659903c7b0b8 |
14 | 2bcad865a0bb |
15 | 1504a7aee736 |
hex | a800af70ce5 |
11545056054501 has 32 divisors (see below), whose sum is σ = 15456193363968. Its totient is φ = 7665393415680.
The previous prime is 11545056054491. The next prime is 11545056054523. The reversal of 11545056054501 is 10545065054511.
It is not a de Polignac number, because 11545056054501 - 27 = 11545056054373 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11545056054551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1841019996 + ... + 1841026266.
It is an arithmetic number, because the mean of its divisors is an integer number (483006042624).
Almost surely, 211545056054501 is an apocalyptic number.
It is an amenable number.
11545056054501 is a deficient number, since it is larger than the sum of its proper divisors (3911137309467).
11545056054501 is a wasteful number, since it uses less digits than its factorization.
11545056054501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9161.
The product of its (nonzero) digits is 300000, while the sum is 42.
The spelling of 11545056054501 in words is "eleven trillion, five hundred forty-five billion, fifty-six million, fifty-four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •