Base | Representation |
---|---|
bin | 10000000001011001011… |
… | …011111011000111001011 |
3 | 10220020220102112210101002 |
4 | 100001121123323013023 |
5 | 121014333100320021 |
6 | 2201444210445215 |
7 | 142355051414516 |
oct | 20013133730713 |
9 | 3806812483332 |
10 | 1101012120011 |
11 | 394a33702811 |
12 | 15947289380b |
13 | 7ca95699c5b |
14 | 3b409a8bd7d |
15 | 1d98e77850b |
hex | 100596fb1cb |
1101012120011 has 8 divisors (see below), whose sum is σ = 1103718786048. Its totient is φ = 1098308673000.
The previous prime is 1101012120001. The next prime is 1101012120079. The reversal of 1101012120011 is 1100212101011.
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 1101012120011 - 226 = 1100945011147 is a prime.
It is a super-2 number, since 2×11010121200112 (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 = 1101012119974 and 1101012120001.
It is not an unprimeable number, because it can be changed into a prime (1101012120001) 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, 119135 + ... + 1488696.
It is an arithmetic number, because the mean of its divisors is an integer number (137964848256).
Almost surely, 21101012120011 is an apocalyptic number.
1101012120011 is a deficient number, since it is larger than the sum of its proper divisors (2706666037).
1101012120011 is an equidigital number, since it uses as much as digits as its factorization.
1101012120011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1609513.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1101012120011 its reverse (1100212101011), we get a palindrome (2201224221022).
The spelling of 1101012120011 in words is "one trillion, one hundred one billion, twelve million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •