Base | Representation |
---|---|
bin | 10111001110000010110000… |
… | …111001001001110011110101 |
3 | 111101120120212001200211121112 |
4 | 113032002300321021303311 |
5 | 101341113441202431401 |
6 | 1001105155254124405 |
7 | 30336635346415535 |
oct | 2716026071116365 |
9 | 441516761624545 |
10 | 102120110202101 |
11 | 2a5a1993a415a2 |
12 | b55368a350705 |
13 | 44c9b6766aa04 |
14 | 1b308d54d34c5 |
15 | bc15a22703bb |
hex | 5ce0b0e49cf5 |
102120110202101 has 8 divisors (see below), whose sum is σ = 102261652182144. Its totient is φ = 101978571174480.
The previous prime is 102120110202079. The next prime is 102120110202133. The reversal of 102120110202101 is 101202011021201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102120110202101 - 210 = 102120110201077 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102120110202181) 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, 73680416 + ... + 75053606.
It is an arithmetic number, because the mean of its divisors is an integer number (12782706522768).
Almost surely, 2102120110202101 is an apocalyptic number.
It is an amenable number.
102120110202101 is a deficient number, since it is larger than the sum of its proper divisors (141541980043).
102120110202101 is a wasteful number, since it uses less digits than its factorization.
102120110202101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1476211.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 102120110202101 its reverse (101202011021201), we get a palindrome (203322121223302).
The spelling of 102120110202101 in words is "one hundred two trillion, one hundred twenty billion, one hundred ten million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •