Base | Representation |
---|---|
bin | 10000010011000101010… |
… | …001100011101010000011 |
3 | 10222001220210212120011202 |
4 | 100103011101203222003 |
5 | 121322230302223021 |
6 | 2214304344531415 |
7 | 143626450134044 |
oct | 20230521435203 |
9 | 3861823776152 |
10 | 1120001211011 |
11 | 3a1a98537951 |
12 | 161092180b6b |
13 | 818007b8187 |
14 | 3c2cb9c68cb |
15 | 1e2018aaa0b |
hex | 104c5463a83 |
1120001211011 has 4 divisors (see below), whose sum is σ = 1125629358000. Its totient is φ = 1114373064024.
The previous prime is 1120001210981. The next prime is 1120001211061. The reversal of 1120001211011 is 1101121000211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1120001211011 - 234 = 1102821341827 is a prime.
It is a super-2 number, since 2×11200012110112 (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 = 1120001210983 and 1120001211001.
It is not an unprimeable number, because it can be changed into a prime (1120001211061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2814073196 + ... + 2814073593.
It is an arithmetic number, because the mean of its divisors is an integer number (281407339500).
Almost surely, 21120001211011 is an apocalyptic number.
1120001211011 is a deficient number, since it is larger than the sum of its proper divisors (5628146989).
1120001211011 is an equidigital number, since it uses as much as digits as its factorization.
1120001211011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5628146988.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1120001211011 its reverse (1101121000211), we get a palindrome (2221122211222).
The spelling of 1120001211011 in words is "one trillion, one hundred twenty billion, one million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •