Base | Representation |
---|---|
bin | 10000000001011111110… |
… | …111011111101101110011 |
3 | 10220021011221120020011012 |
4 | 100001133313133231303 |
5 | 121020043210323443 |
6 | 2201503023141135 |
7 | 142360531444046 |
oct | 20013767375563 |
9 | 3807157506135 |
10 | 1101120011123 |
11 | 394a895a3a20 |
12 | 1594a2a447ab |
13 | 7cab1b44452 |
14 | 3b41a134c5d |
15 | 1d998e8b118 |
hex | 1005fddfb73 |
1101120011123 has 8 divisors (see below), whose sum is σ = 1202038450176. Its totient is φ = 1000337675400.
The previous prime is 1101120011099. The next prime is 1101120011213. The reversal of 1101120011123 is 3211100211011.
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 1101120011123 - 220 = 1101118962547 is a prime.
It is a super-2 number, since 2×11011200111232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101120011098 and 1101120011107.
It is not an unprimeable number, because it can be changed into a prime (1101120011623) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34008911 + ... + 34041272.
It is an arithmetic number, because the mean of its divisors is an integer number (150254806272).
Almost surely, 21101120011123 is an apocalyptic number.
1101120011123 is a deficient number, since it is larger than the sum of its proper divisors (100918439053).
1101120011123 is a wasteful number, since it uses less digits than its factorization.
1101120011123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68051665.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 1101120011123 its reverse (3211100211011), we get a palindrome (4312220222134).
The spelling of 1101120011123 in words is "one trillion, one hundred one billion, one hundred twenty million, eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •