Base | Representation |
---|---|
bin | 10111001101110010000101… |
… | …011111001010110101110111 |
3 | 111101111212122000110001022220 |
4 | 113031302011133022311313 |
5 | 101340320302214213421 |
6 | 1001053034253253423 |
7 | 30335432515155552 |
oct | 2715620537126567 |
9 | 441455560401286 |
10 | 102102202101111 |
11 | 2a595334318233 |
12 | b550110a94273 |
13 | 44c82724a5854 |
14 | 1b2dab6d89699 |
15 | bc0da4ebb3c6 |
hex | 5cdc857cad77 |
102102202101111 has 8 divisors (see below), whose sum is σ = 136136366436480. Its totient is φ = 68068086249912.
The previous prime is 102102202101089. The next prime is 102102202101169. The reversal of 102102202101111 is 111101202201201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102102202101111 - 233 = 102093612166519 is a prime.
It is a super-2 number, since 2×1021022021011112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102102202101611) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6884065 + ... + 15861738.
It is an arithmetic number, because the mean of its divisors is an integer number (17017045804560).
Almost surely, 2102102202101111 is an apocalyptic number.
102102202101111 is a deficient number, since it is larger than the sum of its proper divisors (34034164335369).
102102202101111 is a wasteful number, since it uses less digits than its factorization.
102102202101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24242085.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 102102202101111 its reverse (111101202201201), we get a palindrome (213203404302312).
The spelling of 102102202101111 in words is "one hundred two trillion, one hundred two billion, two hundred two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •