Base | Representation |
---|---|
bin | 10111010011100100100110… |
… | …101110000010100000010011 |
3 | 111102220220112022101201200022 |
4 | 113103210212232002200103 |
5 | 101413330042243402011 |
6 | 1001555511544414055 |
7 | 30406245434433635 |
oct | 2723444656024023 |
9 | 442826468351608 |
10 | 102500044122131 |
11 | 2a72902a811027 |
12 | b5b524147732b |
13 | 4526935a05c46 |
14 | 1b450586cca55 |
15 | bcb3dc1e88db |
hex | 5d3926b82813 |
102500044122131 has 2 divisors, whose sum is σ = 102500044122132. Its totient is φ = 102500044122130.
The previous prime is 102500044122067. The next prime is 102500044122163. The reversal of 102500044122131 is 131221440005201.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102500044122131 - 26 = 102500044122067 is a prime.
It is a super-2 number, since 2×1025000441221312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102500044122131.
It is not a weakly prime, because it can be changed into another prime (102500044122731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51250022061065 + 51250022061066.
It is an arithmetic number, because the mean of its divisors is an integer number (51250022061066).
Almost surely, 2102500044122131 is an apocalyptic number.
102500044122131 is a deficient number, since it is larger than the sum of its proper divisors (1).
102500044122131 is an equidigital number, since it uses as much as digits as its factorization.
102500044122131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 102500044122131 its reverse (131221440005201), we get a palindrome (233721484127332).
The spelling of 102500044122131 in words is "one hundred two trillion, five hundred billion, forty-four million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •