Base | Representation |
---|---|
bin | 11110111000010010001… |
… | …111111011110000000011 |
3 | 21111212022020000122122011 |
4 | 132320102033323300003 |
5 | 234231344110323021 |
6 | 4302501553153351 |
7 | 306211430325265 |
oct | 36702217736003 |
9 | 7455266018564 |
10 | 2122020011011 |
11 | 748a41a8009a |
12 | 2a331825b857 |
13 | 12514b0b1214 |
14 | 749c61bdb35 |
15 | 3a2ea499de1 |
hex | 1ee123fbc03 |
2122020011011 has 4 divisors (see below), whose sum is σ = 2122138109224. Its totient is φ = 2121901912800.
The previous prime is 2122020011009. The next prime is 2122020011017. The reversal of 2122020011011 is 1101100202212.
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 2122020011011 - 21 = 2122020011009 is a prime.
It is a super-2 number, since 2×21220200110112 (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 = 2122020010982 and 2122020011000.
It is not an unprimeable number, because it can be changed into a prime (2122020011017) 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, 59022150 + ... + 59058091.
It is an arithmetic number, because the mean of its divisors is an integer number (530534527306).
Almost surely, 22122020011011 is an apocalyptic number.
2122020011011 is a deficient number, since it is larger than the sum of its proper divisors (118098213).
2122020011011 is a wasteful number, since it uses less digits than its factorization.
2122020011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118098212.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2122020011011 its reverse (1101100202212), we get a palindrome (3223120213223).
The spelling of 2122020011011 in words is "two trillion, one hundred twenty-two billion, twenty million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •