Base | Representation |
---|---|
bin | 11110101111000011101… |
… | …011111000001111100101 |
3 | 21110220201201100122110020 |
4 | 132233003223320033211 |
5 | 234101101133031041 |
6 | 4254142454145353 |
7 | 305411050540560 |
oct | 36570353701745 |
9 | 7426651318406 |
10 | 2112112002021 |
11 | 74481818730a |
12 | 2a1412052259 |
13 | 12422c491cc8 |
14 | 743263654d7 |
15 | 39e1a70d866 |
hex | 1ebc3af83e5 |
2112112002021 has 16 divisors (see below), whose sum is σ = 3224234600064. Its totient is φ = 1204754313024.
The previous prime is 2112112002017. The next prime is 2112112002043. The reversal of 2112112002021 is 1202002112112.
It is not a de Polignac number, because 2112112002021 - 22 = 2112112002017 is a prime.
It is a super-3 number, since 3×21121120020213 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112112003021) 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, 90272650 + ... + 90296043.
It is an arithmetic number, because the mean of its divisors is an integer number (201514662504).
Almost surely, 22112112002021 is an apocalyptic number.
2112112002021 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2112112002021 is a deficient number, since it is larger than the sum of its proper divisors (1112122598043).
2112112002021 is a wasteful number, since it uses less digits than its factorization.
2112112002021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180569260.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2112112002021 its reverse (1202002112112), we get a palindrome (3314114114133).
The spelling of 2112112002021 in words is "two trillion, one hundred twelve billion, one hundred twelve million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •