Base | Representation |
---|---|
bin | 10101100001000000… |
… | …11111100100111011 |
3 | 1002211000200220212100 |
4 | 22300200133210323 |
5 | 142124104230210 |
6 | 5150115114443 |
7 | 556151640666 |
oct | 126040374473 |
9 | 32730626770 |
10 | 11551242555 |
11 | 4998414556 |
12 | 22a45a2a23 |
13 | 11211b1588 |
14 | 7b81a46dd |
15 | 47917a5c0 |
hex | 2b081f93b |
11551242555 has 24 divisors (see below), whose sum is σ = 20122783200. Its totient is φ = 6129699840.
The previous prime is 11551242541. The next prime is 11551242559. The reversal of 11551242555 is 55524215511.
11551242555 is a `hidden beast` number, since 1 + 1 + 55 + 12 + 42 + 555 = 666.
11551242555 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 11551242555 - 27 = 11551242427 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11551242559) 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, 636006 + ... + 653915.
It is an arithmetic number, because the mean of its divisors is an integer number (838449300).
Almost surely, 211551242555 is an apocalyptic number.
11551242555 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11551242555 is a deficient number, since it is larger than the sum of its proper divisors (8571540645).
11551242555 is a wasteful number, since it uses less digits than its factorization.
11551242555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1290131 (or 1290128 counting only the distinct ones).
The product of its digits is 50000, while the sum is 36.
The spelling of 11551242555 in words is "eleven billion, five hundred fifty-one million, two hundred forty-two thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •