Base | Representation |
---|---|
bin | 11101010001110101110… |
… | …011110110001100001111 |
3 | 21010100101012220002211120 |
4 | 131101311303312030033 |
5 | 230431104413020421 |
6 | 4140150525252023 |
7 | 265235522122020 |
oct | 35216563661417 |
9 | 7110335802746 |
10 | 2012021220111 |
11 | 706325586441 |
12 | 285b39a04013 |
13 | 11796ac18776 |
14 | 6d54d232c47 |
15 | 3750d5408c6 |
hex | 1d475cf630f |
2012021220111 has 8 divisors (see below), whose sum is σ = 3065937097344. Its totient is φ = 1149726411480.
The previous prime is 2012021220107. The next prime is 2012021220127. The reversal of 2012021220111 is 1110221202102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2012021220111 - 22 = 2012021220107 is a prime.
It is a super-2 number, since 2×20120212201112 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2012021220211) 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, 47905267125 + ... + 47905267166.
It is an arithmetic number, because the mean of its divisors is an integer number (383242137168).
Almost surely, 22012021220111 is an apocalyptic number.
2012021220111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2012021220111 is a deficient number, since it is larger than the sum of its proper divisors (1053915877233).
2012021220111 is an equidigital number, since it uses as much as digits as its factorization.
2012021220111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95810534301.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2012021220111 its reverse (1110221202102), we get a palindrome (3122242422213).
The spelling of 2012021220111 in words is "two trillion, twelve billion, twenty-one million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •