Base | Representation |
---|---|
bin | 11110101110111101101… |
… | …011011011010000100001 |
3 | 21110220110200201101111211 |
4 | 132232331223123100201 |
5 | 234100344333020001 |
6 | 4254124454110121 |
7 | 305405415110464 |
oct | 36567553332041 |
9 | 7426420641454 |
10 | 2112011220001 |
11 | 744776301291 |
12 | 2a13a434b341 |
13 | 124214636587 |
14 | 74316c0d2db |
15 | 39e11952351 |
hex | 1ebbdadb421 |
2112011220001 has 4 divisors (see below), whose sum is σ = 2147808020400. Its totient is φ = 2076214419604.
The previous prime is 2112011219911. The next prime is 2112011220029. The reversal of 2112011220001 is 1000221102112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2112011220001 - 233 = 2103421285409 is a prime.
It is a super-2 number, since 2×21120112200012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2112011223001) 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, 17898400111 + ... + 17898400228.
It is an arithmetic number, because the mean of its divisors is an integer number (536952005100).
Almost surely, 22112011220001 is an apocalyptic number.
It is an amenable number.
2112011220001 is a deficient number, since it is larger than the sum of its proper divisors (35796800399).
2112011220001 is an equidigital number, since it uses as much as digits as its factorization.
2112011220001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35796800398.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2112011220001 its reverse (1000221102112), we get a palindrome (3112232322113).
The spelling of 2112011220001 in words is "two trillion, one hundred twelve billion, eleven million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •