Base | Representation |
---|---|
bin | 10100101011111100… |
… | …00001110010110010 |
3 | 1001122222220020222012 |
4 | 22111332001302302 |
5 | 140221114000200 |
6 | 5034012042522 |
7 | 542134304615 |
oct | 122576016262 |
9 | 31588806865 |
10 | 11106000050 |
11 | 478a058242 |
12 | 219b463442 |
13 | 107cb8c182 |
14 | 774dc417c |
15 | 45002ba35 |
hex | 295f81cb2 |
11106000050 has 48 divisors (see below), whose sum is σ = 21240140544. Its totient is φ = 4317840000.
The previous prime is 11106000043. The next prime is 11106000071. The reversal of 11106000050 is 5000060111.
11106000050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×111060000502 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11105999989 and 11106000034.
It is an unprimeable number.
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, 545555 + ... + 565545.
It is an arithmetic number, because the mean of its divisors is an integer number (442502928).
Almost surely, 211106000050 is an apocalyptic number.
11106000050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11106000050 is a deficient number, since it is larger than the sum of its proper divisors (10134140494).
11106000050 is a wasteful number, since it uses less digits than its factorization.
11106000050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20315 (or 20310 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 14.
Adding to 11106000050 its reverse (5000060111), we get a palindrome (16106060161).
The spelling of 11106000050 in words is "eleven billion, one hundred six million, fifty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •