Base | Representation |
---|---|
bin | 1010100000100010011011… |
… | …0110001001100101011001 |
3 | 1111220120012001102222210220 |
4 | 2220020212312021211121 |
5 | 3003300311110133411 |
6 | 40323515300230253 |
7 | 2301520465324653 |
oct | 250104666114531 |
9 | 44816161388726 |
10 | 11554113755481 |
11 | 3755087aaa880 |
12 | 136732139b389 |
13 | 65a718681a8b |
14 | 2bd3175b16d3 |
15 | 150837dc7b06 |
hex | a8226d89959 |
11554113755481 has 64 divisors (see below), whose sum is σ = 17684022435840. Its totient is φ = 6646428864000.
The previous prime is 11554113755407. The next prime is 11554113755537. The reversal of 11554113755481 is 18455731145511.
It is not a de Polignac number, because 11554113755481 - 211 = 11554113753433 is a prime.
It is a super-2 number, since 2×115541137554812 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11554113755581) 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 63 ways as a sum of consecutive naturals, for example, 12935371 + ... + 13799711.
It is an arithmetic number, because the mean of its divisors is an integer number (276312850560).
Almost surely, 211554113755481 is an apocalyptic number.
11554113755481 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11554113755481 is a deficient number, since it is larger than the sum of its proper divisors (6129908680359).
11554113755481 is a wasteful number, since it uses less digits than its factorization.
11554113755481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 864638.
The product of its digits is 1680000, while the sum is 51.
The spelling of 11554113755481 in words is "eleven trillion, five hundred fifty-four billion, one hundred thirteen million, seven hundred fifty-five thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •