Base | Representation |
---|---|
bin | 110000001101000010010101… |
… | …111111100111011000001111 |
3 | 1000210122012111000101121020200 |
4 | 300031002111333213120033 |
5 | 210241420301131241421 |
6 | 2030520230553144543 |
7 | 62440434503666361 |
oct | 6015022577473017 |
9 | 1023565430347220 |
10 | 212002102212111 |
11 | 6160664a8a7232 |
12 | 1b93b5170bb153 |
13 | 913a935362453 |
14 | 3a4cd568a6d31 |
15 | 19799db812726 |
hex | c0d095fe760f |
212002102212111 has 12 divisors (see below), whose sum is σ = 316784750432280. Its totient is φ = 136461123262800.
The previous prime is 212002102211983. The next prime is 212002102212143. The reversal of 212002102212111 is 111212201200212.
212002102212111 is a `hidden beast` number, since 2 + 1 + 20 + 0 + 210 + 221 + 211 + 1 = 666.
It is not a de Polignac number, because 212002102212111 - 27 = 212002102211983 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212002102212151) 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, 406134295165 + ... + 406134295686.
It is an arithmetic number, because the mean of its divisors is an integer number (26398729202690).
Almost surely, 2212002102212111 is an apocalyptic number.
212002102212111 is a deficient number, since it is larger than the sum of its proper divisors (104782648220169).
212002102212111 is a wasteful number, since it uses less digits than its factorization.
212002102212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 812268590886 (or 812268590883 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 212002102212111 its reverse (111212201200212), we get a palindrome (323214303412323).
The spelling of 212002102212111 in words is "two hundred twelve trillion, two billion, one hundred two million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •