Base | Representation |
---|---|
bin | 1010000000111011100111… |
… | …1101111011101111111011 |
3 | 1102222122121222011011212021 |
4 | 2200032321331323233323 |
5 | 2420401234011400443 |
6 | 35230234513255311 |
7 | 2214345563626312 |
oct | 240167175735773 |
9 | 42878558134767 |
10 | 11011121200123 |
11 | 35658769491a0 |
12 | 129a042264537 |
13 | 61b4624a5945 |
14 | 2a0d26595279 |
15 | 141657bd99ed |
hex | a03b9f7bbfb |
11011121200123 has 32 divisors (see below), whose sum is σ = 12470159692800. Its totient is φ = 9630894806400.
The previous prime is 11011121200111. The next prime is 11011121200127. The reversal of 11011121200123 is 32100212111011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11011121200123 - 229 = 11010584329211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11011121200097 and 11011121200106.
It is not an unprimeable number, because it can be changed into a prime (11011121200127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 158118690 + ... + 158188312.
It is an arithmetic number, because the mean of its divisors is an integer number (389692490400).
Almost surely, 211011121200123 is an apocalyptic number.
11011121200123 is a deficient number, since it is larger than the sum of its proper divisors (1459038492677).
11011121200123 is a wasteful number, since it uses less digits than its factorization.
11011121200123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71403.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 11011121200123 its reverse (32100212111011), we get a palindrome (43111333311134).
The spelling of 11011121200123 in words is "eleven trillion, eleven billion, one hundred twenty-one million, two hundred thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •