Base | Representation |
---|---|
bin | 110000001101000000011111… |
… | …110110011101100100001101 |
3 | 1000210122000100212200221010222 |
4 | 300031000133312131210031 |
5 | 210241402221221214013 |
6 | 2030515302145441125 |
7 | 62440334415222230 |
oct | 6015003766354415 |
9 | 1023560325627128 |
10 | 212000120101133 |
11 | 61605822a68991 |
12 | 1b93b0633401a5 |
13 | 913a6aa80c710 |
14 | 3a4cc09547417 |
15 | 19799227d5508 |
hex | c0d01fd9d90d |
212000120101133 has 96 divisors (see below), whose sum is σ = 271599938217216. Its totient is φ = 161045748864000.
The previous prime is 212000120101123. The next prime is 212000120101163. The reversal of 212000120101133 is 331101021000212.
It is not a de Polignac number, because 212000120101133 - 238 = 211725242194189 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212000120101103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 10588877663 + ... + 10588897683.
It is an arithmetic number, because the mean of its divisors is an integer number (2829166023096).
Almost surely, 2212000120101133 is an apocalyptic number.
It is an amenable number.
212000120101133 is a deficient number, since it is larger than the sum of its proper divisors (59599818116083).
212000120101133 is a wasteful number, since it uses less digits than its factorization.
212000120101133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20787 (or 20716 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 212000120101133 its reverse (331101021000212), we get a palindrome (543101141101345).
The spelling of 212000120101133 in words is "two hundred twelve trillion, one hundred twenty million, one hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •