Base | Representation |
---|---|
bin | 10101011011101100… |
… | …11100011001011010 |
3 | 1002200220211011000122 |
4 | 22231312130121122 |
5 | 142031201240200 |
6 | 5141443433242 |
7 | 555101016266 |
oct | 125566343132 |
9 | 32626734018 |
10 | 11506665050 |
11 | 4975237841 |
12 | 2291685822 |
13 | 1114ba435a |
14 | 7b22bd0a6 |
15 | 4752c2385 |
hex | 2add9c65a |
11506665050 has 72 divisors (see below), whose sum is σ = 23932590240. Its totient is φ = 4103827200.
The previous prime is 11506665043. The next prime is 11506665083. The reversal of 11506665050 is 5056660511.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11506665050.
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 253595 + ... + 295505.
Almost surely, 211506665050 is an apocalyptic number.
11506665050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11506665050 is an abundant number, since it is smaller than the sum of its proper divisors (12425925190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11506665050 is a wasteful number, since it uses less digits than its factorization.
11506665050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41976 (or 41954 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 11506665050 in words is "eleven billion, five hundred six million, six hundred sixty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •