Base | Representation |
---|---|
bin | 110000001110011111100101… |
… | …011111000101110100000111 |
3 | 1000210222202220101212211112000 |
4 | 300032133211133011310013 |
5 | 210300040321322023421 |
6 | 2031034225331200343 |
7 | 62450610512045631 |
oct | 6016374537056407 |
9 | 1023882811784460 |
10 | 212102220111111 |
11 | 61645056839620 |
12 | 1b9569b84460b3 |
13 | 91471cc4116c5 |
14 | 3a53b33457a51 |
15 | 197c3eb08a226 |
hex | c0e7e57c5d07 |
212102220111111 has 16 divisors (see below), whose sum is σ = 342791466846720. Its totient is φ = 128546800067160.
The previous prime is 212102220111107. The next prime is 212102220111121. The reversal of 212102220111111 is 111111022201212.
It is a happy number.
212102220111111 is a `hidden beast` number, since 212 + 10 + 2 + 220 + 111 + 111 = 666.
It is not a de Polignac number, because 212102220111111 - 22 = 212102220111107 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212102220111121) 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, 357074444335 + ... + 357074444928.
It is an arithmetic number, because the mean of its divisors is an integer number (21424466677920).
Almost surely, 2212102220111111 is an apocalyptic number.
212102220111111 is a deficient number, since it is larger than the sum of its proper divisors (130689246735609).
212102220111111 is a wasteful number, since it uses less digits than its factorization.
212102220111111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 714148889283 (or 714148889277 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 212102220111111 its reverse (111111022201212), we get a palindrome (323213242312323).
The spelling of 212102220111111 in words is "two hundred twelve trillion, one hundred two billion, two hundred twenty million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •