Base | Representation |
---|---|
bin | 110000000000000100101000… |
… | …110011100011000111010110 |
3 | 1000200111000221100110212202100 |
4 | 300000010220303203013112 |
5 | 210132321230244231402 |
6 | 2024555052454222530 |
7 | 62316165432003024 |
oct | 6000045063430726 |
9 | 1020430840425670 |
10 | 211111212102102 |
11 | 612a2842634644 |
12 | 1b816925954a46 |
13 | 90a49180508c0 |
14 | 3a1bba133d714 |
15 | 1961748e6c71c |
hex | c00128ce31d6 |
211111212102102 has 96 divisors (see below), whose sum is σ = 520420890487680. Its totient is φ = 61382976641280.
The previous prime is 211111212102047. The next prime is 211111212102143. The reversal of 211111212102102 is 201201212111112.
It is a happy number.
211111212102102 is a `hidden beast` number, since 211 + 1 + 11 + 21 + 210 + 210 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 330636549 + ... + 331274432.
It is an arithmetic number, because the mean of its divisors is an integer number (5421050942580).
Almost surely, 2211111212102102 is an apocalyptic number.
211111212102102 is an abundant number, since it is smaller than the sum of its proper divisors (309309678385578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211111212102102 is a wasteful number, since it uses less digits than its factorization.
211111212102102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 661911078 (or 661911075 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 211111212102102 its reverse (201201212111112), we get a palindrome (412312424213214).
The spelling of 211111212102102 in words is "two hundred eleven trillion, one hundred eleven billion, two hundred twelve million, one hundred two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •