Base | Representation |
---|---|
bin | 11011101111011111110010… |
… | …111101001101110011111110 |
3 | 121000000011021011012010212200 |
4 | 123233133302331031303332 |
5 | 111443012430300023402 |
6 | 1111255102124212330 |
7 | 34462006402103616 |
oct | 3357376275156376 |
9 | 530004234163780 |
10 | 122011212111102 |
11 | 35970734458016 |
12 | 1182671009a0a6 |
13 | 53107b98233c2 |
14 | 221b534a45a46 |
15 | e18bd1b2021c |
hex | 6ef7f2f4dcfe |
122011212111102 has 24 divisors (see below), whose sum is σ = 270805373223840. Its totient is φ = 39678442962720.
The previous prime is 122011212111049. The next prime is 122011212111157. The reversal of 122011212111102 is 201111212110221.
It is a happy number.
122011212111102 is a `hidden beast` number, since 1 + 220 + 1 + 121 + 211 + 110 + 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 11 ways as a sum of consecutive naturals, for example, 82663422102 + ... + 82663423577.
It is an arithmetic number, because the mean of its divisors is an integer number (11283557217660).
Almost surely, 2122011212111102 is an apocalyptic number.
122011212111102 is an abundant number, since it is smaller than the sum of its proper divisors (148794161112738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122011212111102 is a wasteful number, since it uses less digits than its factorization.
122011212111102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 165326845728 (or 165326845725 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 122011212111102 its reverse (201111212110221), we get a palindrome (323122424221323).
The spelling of 122011212111102 in words is "one hundred twenty-two trillion, eleven billion, two hundred twelve million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •