Base | Representation |
---|---|
bin | 10111001110000010110001… |
… | …000000011001011011110111 |
3 | 111101120120212012021022120020 |
4 | 113032002301000121123313 |
5 | 101341113442144213421 |
6 | 1001105155402540223 |
7 | 30336635401515156 |
oct | 2716026100313367 |
9 | 441516765238506 |
10 | 102120112101111 |
11 | 2a5a1995019325 |
12 | b55368ab07673 |
13 | 44c9b67b841a0 |
14 | 1b308d586959d |
15 | bc15a24e7dc6 |
hex | 5ce0b10196f7 |
102120112101111 has 8 divisors (see below), whose sum is σ = 146634007119600. Its totient is φ = 62843145908352.
The previous prime is 102120112101109. The next prime is 102120112101167. The reversal of 102120112101111 is 111101211021201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102120112101111 - 21 = 102120112101109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102120112801111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1309232206386 + ... + 1309232206463.
It is an arithmetic number, because the mean of its divisors is an integer number (18329250889950).
Almost surely, 2102120112101111 is an apocalyptic number.
102120112101111 is a deficient number, since it is larger than the sum of its proper divisors (44513895018489).
102120112101111 is a wasteful number, since it uses less digits than its factorization.
102120112101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2618464412865.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 102120112101111 its reverse (111101211021201), we get a palindrome (213221323122312).
The spelling of 102120112101111 in words is "one hundred two trillion, one hundred twenty billion, one hundred twelve million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •