Base | Representation |
---|---|
bin | 1010000000111011100011… |
… | …0001101110010011101011 |
3 | 1102222122120120120012012100 |
4 | 2200032320301232103223 |
5 | 2420401213403101443 |
6 | 35230232521144443 |
7 | 2214345232051362 |
oct | 240167061562353 |
9 | 42878516505170 |
10 | 11011101222123 |
11 | 3565866643452 |
12 | 129a03762b123 |
13 | 61b45b2cc542 |
14 | 2a0d23a747d9 |
15 | 1416560903d3 |
hex | a03b8c6e4eb |
11011101222123 has 6 divisors (see below), whose sum is σ = 15904923987524. Its totient is φ = 7340734148076.
The previous prime is 11011101222089. The next prime is 11011101222133. The reversal of 11011101222123 is 32122210111011.
It is a happy number.
11011101222123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11011101222123 - 26 = 11011101222059 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11011101222096 and 11011101222105.
It is not an unprimeable number, because it can be changed into a prime (11011101222133) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 611727845665 + ... + 611727845682.
Almost surely, 211011101222123 is an apocalyptic number.
11011101222123 is a deficient number, since it is larger than the sum of its proper divisors (4893822765401).
11011101222123 is a wasteful number, since it uses less digits than its factorization.
11011101222123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1223455691353 (or 1223455691350 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 11011101222123 its reverse (32122210111011), we get a palindrome (43133311333134).
The spelling of 11011101222123 in words is "eleven trillion, eleven billion, one hundred one million, two hundred twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •