Base | Representation |
---|---|
bin | 110000010001111110010010… |
… | …001001100010100000010111 |
3 | 1000211211122010002100221011200 |
4 | 300101332102021202200113 |
5 | 210313000031032333421 |
6 | 2031340133123003543 |
7 | 62504104233435135 |
oct | 6021762211424027 |
9 | 1024748102327150 |
10 | 212341340121111 |
11 | 617275028532a3 |
12 | 1b9952112095b3 |
13 | 91639193a4596 |
14 | 3a61538cb8755 |
15 | 1983743b1d726 |
hex | c11f92262817 |
212341340121111 has 12 divisors (see below), whose sum is σ = 307372046947992. Its totient is φ = 141257765159856.
The previous prime is 212341340121091. The next prime is 212341340121121. The reversal of 212341340121111 is 111121043143212.
212341340121111 is a `hidden beast` number, since 2 + 1 + 2 + 3 + 41 + 3 + 401 + 211 + 1 + 1 = 666.
It is not a de Polignac number, because 212341340121111 - 233 = 212332750186519 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212341340121121) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25260683416 + ... + 25260691821.
It is an arithmetic number, because the mean of its divisors is an integer number (25614337245666).
Almost surely, 2212341340121111 is an apocalyptic number.
212341340121111 is a deficient number, since it is larger than the sum of its proper divisors (95030706826881).
212341340121111 is a wasteful number, since it uses less digits than its factorization.
212341340121111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50521375710 (or 50521375707 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
Adding to 212341340121111 its reverse (111121043143212), we get a palindrome (323462383264323).
The spelling of 212341340121111 in words is "two hundred twelve trillion, three hundred forty-one billion, three hundred forty million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •