Base | Representation |
---|---|
bin | 10111001101111010011110… |
… | …011110001100110101000110 |
3 | 111101112201212212200022021100 |
4 | 113031322132132030311012 |
5 | 101340442230032241402 |
6 | 1001101124242000530 |
7 | 30336202001304351 |
oct | 2715723636146506 |
9 | 441481785608240 |
10 | 102111211212102 |
11 | 2a599137771704 |
12 | b551a06046146 |
13 | 44c9079ac5b61 |
14 | 1b302cd693298 |
15 | bc1230d9771c |
hex | 5cde9e78cd46 |
102111211212102 has 48 divisors (see below), whose sum is σ = 239702925393360. Its totient is φ = 31289892350976.
The previous prime is 102111211212091. The next prime is 102111211212149. The reversal of 102111211212102 is 201212112111201.
It is a happy number.
102111211212102 is a `hidden beast` number, since 1 + 0 + 211 + 121 + 121 + 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 23 ways as a sum of consecutive naturals, for example, 3880181827 + ... + 3880208142.
It is an arithmetic number, because the mean of its divisors is an integer number (4993810945695).
Almost surely, 2102111211212102 is an apocalyptic number.
102111211212102 is an abundant number, since it is smaller than the sum of its proper divisors (137591714181258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102111211212102 is a wasteful number, since it uses less digits than its factorization.
102111211212102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7760390037 (or 7760390034 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 102111211212102 its reverse (201212112111201), we get a palindrome (303323323323303).
The spelling of 102111211212102 in words is "one hundred two trillion, one hundred eleven billion, two hundred eleven million, two hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •