Base | Representation |
---|---|
bin | 10111001110001101000000… |
… | …000011100101011010101101 |
3 | 111101121122020002201200122122 |
4 | 113032031000003211122231 |
5 | 101341303444103404401 |
6 | 1001114214110522325 |
7 | 30340504626314000 |
oct | 2716150003453255 |
9 | 441548202650578 |
10 | 102131102013101 |
11 | 2a5a6614596917 |
12 | b5558375063a5 |
13 | 44cabc9988ba5 |
14 | 1b31259271537 |
15 | bc19e724321b |
hex | 5ce3400e56ad |
102131102013101 has 16 divisors (see below), whose sum is σ = 119139342806400. Its totient is φ = 87514472203200.
The previous prime is 102131102013047. The next prime is 102131102013121. The reversal of 102131102013101 is 101310201131201.
It is not a de Polignac number, because 102131102013101 - 210 = 102131102012077 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102131102013101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102131102013121) 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, 43885100 + ... + 46153701.
It is an arithmetic number, because the mean of its divisors is an integer number (7446208925400).
Almost surely, 2102131102013101 is an apocalyptic number.
It is an amenable number.
102131102013101 is a deficient number, since it is larger than the sum of its proper divisors (17008240793299).
102131102013101 is an frugal number, since it uses more digits than its factorization.
102131102013101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90042129 (or 90042115 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 102131102013101 its reverse (101310201131201), we get a palindrome (203441303144302).
The spelling of 102131102013101 in words is "one hundred two trillion, one hundred thirty-one billion, one hundred two million, thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •