Base | Representation |
---|---|
bin | 10101100000111000… |
… | …01100110101110101 |
3 | 1002210221120202012220 |
4 | 22300130030311311 |
5 | 142123312222422 |
6 | 5150035032553 |
7 | 556136243121 |
oct | 126034146565 |
9 | 32727522186 |
10 | 11550117237 |
11 | 499781603a |
12 | 22a413b759 |
13 | 1120ba92c9 |
14 | 7b7d90581 |
15 | 479006e5c |
hex | 2b070cd75 |
11550117237 has 32 divisors (see below), whose sum is σ = 17035038720. Its totient is φ = 6928776960.
The previous prime is 11550117221. The next prime is 11550117239. The reversal of 11550117237 is 73271105511.
11550117237 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 11550117237 - 24 = 11550117221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11550117198 and 11550117207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11550117239) 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 31 ways as a sum of consecutive naturals, for example, 87214 + ... + 175232.
It is an arithmetic number, because the mean of its divisors is an integer number (532344960).
Almost surely, 211550117237 is an apocalyptic number.
11550117237 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
11550117237 is a deficient number, since it is larger than the sum of its proper divisors (5484921483).
11550117237 is a wasteful number, since it uses less digits than its factorization.
11550117237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88153.
The product of its (nonzero) digits is 7350, while the sum is 33.
The spelling of 11550117237 in words is "eleven billion, five hundred fifty million, one hundred seventeen thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •