Base | Representation |
---|---|
bin | 10111001101111011010100… |
… | …101100110110011010010101 |
3 | 111101112211020021122102221222 |
4 | 113031323110230312122111 |
5 | 101341001110440201401 |
6 | 1001101354422220125 |
7 | 30336233356461551 |
oct | 2715732454663225 |
9 | 441484207572858 |
10 | 102112121022101 |
11 | 2a5995642943a3 |
12 | b55201a884645 |
13 | 44c9193445778 |
14 | 1b30378444861 |
15 | bc1285bb0c1b |
hex | 5cded4b36695 |
102112121022101 has 16 divisors (see below), whose sum is σ = 102433452768000. Its totient is φ = 101791245523968.
The previous prime is 102112121022071. The next prime is 102112121022127. The reversal of 102112121022101 is 101220121211201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102112121022101 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102112121022101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102112123022101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2683399391 + ... + 2683437443.
It is an arithmetic number, because the mean of its divisors is an integer number (6402090798000).
Almost surely, 2102112121022101 is an apocalyptic number.
It is an amenable number.
102112121022101 is a deficient number, since it is larger than the sum of its proper divisors (321331745899).
102112121022101 is a wasteful number, since it uses less digits than its factorization.
102112121022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43828.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 102112121022101 its reverse (101220121211201), we get a palindrome (203332242233302).
The spelling of 102112121022101 in words is "one hundred two trillion, one hundred twelve billion, one hundred twenty-one million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •