Base | Representation |
---|---|
bin | 10100100000101000… |
… | …00001000111000011 |
3 | 1001102101022220010010 |
4 | 22100110001013003 |
5 | 140022320213443 |
6 | 5020342040003 |
7 | 536602546431 |
oct | 122024010703 |
9 | 31371286103 |
10 | 11011101123 |
11 | 4740530280 |
12 | 2173719003 |
13 | 1066313469 |
14 | 76655dd51 |
15 | 446a33733 |
hex | 2905011c3 |
11011101123 has 8 divisors (see below), whose sum is σ = 16016147136. Its totient is φ = 6673394600.
The previous prime is 11011101107. The next prime is 11011101187. The reversal of 11011101123 is 32110111011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11011101123 - 24 = 11011101107 is a prime.
It is a super-2 number, since 2×110111011232 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11011101099 and 11011101108.
It is not an unprimeable number, because it can be changed into a prime (11011101523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 166834833 + ... + 166834898.
It is an arithmetic number, because the mean of its divisors is an integer number (2002018392).
Almost surely, 211011101123 is an apocalyptic number.
11011101123 is a deficient number, since it is larger than the sum of its proper divisors (5005046013).
11011101123 is a wasteful number, since it uses less digits than its factorization.
11011101123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333669745.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 11011101123 its reverse (32110111011), we get a palindrome (43121212134).
The spelling of 11011101123 in words is "eleven billion, eleven million, one hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •