Base | Representation |
---|---|
bin | 10100110011011101… |
… | …10111110011101111 |
3 | 1001211101200220000100 |
4 | 22121232313303233 |
5 | 140333244321410 |
6 | 5044145202143 |
7 | 543532042203 |
oct | 123156676357 |
9 | 31741626010 |
10 | 11169135855 |
11 | 4811760099 |
12 | 21b8630353 |
13 | 108cc96537 |
14 | 77d53ab03 |
15 | 45584d8c0 |
hex | 299bb7cef |
11169135855 has 24 divisors (see below), whose sum is σ = 19984348800. Its totient is φ = 5764714560.
The previous prime is 11169135787. The next prime is 11169135863. The reversal of 11169135855 is 55853196111.
11169135855 is a `hidden beast` number, since 1 + 1 + 1 + 69 + 1 + 3 + 585 + 5 = 666.
It is not a de Polignac number, because 11169135855 - 27 = 11169135727 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 11169135855.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4001880 + ... + 4004669.
It is an arithmetic number, because the mean of its divisors is an integer number (832681200).
Almost surely, 211169135855 is an apocalyptic number.
11169135855 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11169135855 is a deficient number, since it is larger than the sum of its proper divisors (8815212945).
11169135855 is a wasteful number, since it uses less digits than its factorization.
11169135855 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8006591 (or 8006588 counting only the distinct ones).
The product of its digits is 162000, while the sum is 45.
The spelling of 11169135855 in words is "eleven billion, one hundred sixty-nine million, one hundred thirty-five thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •