Base | Representation |
---|---|
bin | 10100100101010010… |
… | …00010001100111101 |
3 | 1001112002211112202100 |
4 | 22102221002030331 |
5 | 140112320240203 |
6 | 5024255215313 |
7 | 540555565434 |
oct | 122251021475 |
9 | 31462745670 |
10 | 11050165053 |
11 | 4760591614 |
12 | 2184817539 |
13 | 107143cc05 |
14 | 76b80c11b |
15 | 44a19cea3 |
hex | 292a4233d |
11050165053 has 24 divisors (see below), whose sum is σ = 17114198400. Its totient is φ = 6845664384.
The previous prime is 11050165039. The next prime is 11050165081. The reversal of 11050165053 is 35056105011.
11050165053 is a `hidden beast` number, since 1 + 1 + 0 + 5 + 0 + 1 + 650 + 5 + 3 = 666.
It is not a de Polignac number, because 11050165053 - 210 = 11050164029 is a prime.
It is a super-2 number, since 2×110501650532 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11050165003) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 445023 + ... + 469196.
It is an arithmetic number, because the mean of its divisors is an integer number (713091600).
Almost surely, 211050165053 is an apocalyptic number.
It is an amenable number.
11050165053 is a deficient number, since it is larger than the sum of its proper divisors (6064033347).
11050165053 is a wasteful number, since it uses less digits than its factorization.
11050165053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 914321 (or 914318 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 27.
The spelling of 11050165053 in words is "eleven billion, fifty million, one hundred sixty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •