Base | Representation |
---|---|
bin | 10111010011100100100110… |
… | …101110000010101001101011 |
3 | 111102220220112022101202111112 |
4 | 113103210212232002221223 |
5 | 101413330042243411411 |
6 | 1001555511544420535 |
7 | 30406245434435453 |
oct | 2723444656025153 |
9 | 442826468352445 |
10 | 102500044122731 |
11 | 2a72902a811522 |
12 | b5b524147774b |
13 | 4526935a062b8 |
14 | 1b450586ccd63 |
15 | bcb3dc1e8b8b |
hex | 5d3926b82a6b |
102500044122731 has 2 divisors, whose sum is σ = 102500044122732. Its totient is φ = 102500044122730.
The previous prime is 102500044122719. The next prime is 102500044122733. The reversal of 102500044122731 is 137221440005201.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102500044122731 - 246 = 32131299945067 is a prime.
It is a super-2 number, since 2×1025000441227312 (a number of 29 digits) contains 22 as substring.
Together with 102500044122733, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (102500044122733) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51250022061365 + 51250022061366.
It is an arithmetic number, because the mean of its divisors is an integer number (51250022061366).
Almost surely, 2102500044122731 is an apocalyptic number.
102500044122731 is a deficient number, since it is larger than the sum of its proper divisors (1).
102500044122731 is an equidigital number, since it uses as much as digits as its factorization.
102500044122731 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13440, while the sum is 32.
Adding to 102500044122731 its reverse (137221440005201), we get a palindrome (239721484127932).
The spelling of 102500044122731 in words is "one hundred two trillion, five hundred billion, forty-four million, one hundred twenty-two thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •