Base | Representation |
---|---|
bin | 10111001101110010000101… |
… | …010111100100111111111110 |
3 | 111101111212121212200221112212 |
4 | 113031302011113210333332 |
5 | 101340320301212023402 |
6 | 1001053034142500422 |
7 | 30335432462230022 |
oct | 2715620527447776 |
9 | 441455555627485 |
10 | 102102200111102 |
11 | 2a5953331890a4 |
12 | b550110294712 |
13 | 44c8271c59b29 |
14 | 1b2dab69cc382 |
15 | bc0da4c26952 |
hex | 5cdc855e4ffe |
102102200111102 has 8 divisors (see below), whose sum is σ = 153226896184512. Its totient is φ = 51026568049600.
The previous prime is 102102200111083. The next prime is 102102200111111. The reversal of 102102200111102 is 201111002201201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1021022001111022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12265997774 + ... + 12266006097.
It is an arithmetic number, because the mean of its divisors is an integer number (19153362023064).
Almost surely, 2102102200111102 is an apocalyptic number.
102102200111102 is a deficient number, since it is larger than the sum of its proper divisors (51124696073410).
102102200111102 is a wasteful number, since it uses less digits than its factorization.
102102200111102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24532005954.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 102102200111102 its reverse (201111002201201), we get a palindrome (303213202312303).
The spelling of 102102200111102 in words is "one hundred two trillion, one hundred two billion, two hundred million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •