Base | Representation |
---|---|
bin | 11110101111000100001… |
… | …110001111111100110101 |
3 | 21110220202100022101211221 |
4 | 132233010032033330311 |
5 | 234101110434341041 |
6 | 4254143415230341 |
7 | 305411220245026 |
oct | 36570416177465 |
9 | 7426670271757 |
10 | 2112121012021 |
11 | 744822280699 |
12 | 2a14150783b1 |
13 | 1242312c8077 |
14 | 7432762cc4d |
15 | 39e1b3dd2d1 |
hex | 1ebc438ff35 |
2112121012021 has 16 divisors (see below), whose sum is σ = 2140005431808. Its totient is φ = 2084437728000.
The previous prime is 2112121012013. The next prime is 2112121012037. The reversal of 2112121012021 is 1202101212112.
It is a cyclic number.
It is not a de Polignac number, because 2112121012021 - 23 = 2112121012013 is a prime.
It is a super-2 number, since 2×21121210120212 (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 = 2112121011986 and 2112121012004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112121013021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35523700 + ... + 35583106.
It is an arithmetic number, because the mean of its divisors is an integer number (133750339488).
Almost surely, 22112121012021 is an apocalyptic number.
It is an amenable number.
2112121012021 is a deficient number, since it is larger than the sum of its proper divisors (27884419787).
2112121012021 is a wasteful number, since it uses less digits than its factorization.
2112121012021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61092.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 2112121012021 its reverse (1202101212112), we get a palindrome (3314222224133).
The spelling of 2112121012021 in words is "two trillion, one hundred twelve billion, one hundred twenty-one million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •