Base | Representation |
---|---|
bin | 101111000101111010… |
… | …0110001000001110101 |
3 | 100200000221011001000222 |
4 | 1132023310301001311 |
5 | 3124103302110031 |
6 | 114243013144125 |
7 | 10210045531001 |
oct | 1361364610165 |
9 | 320027131028 |
10 | 101130113141 |
11 | 39986348902 |
12 | 1772432b045 |
13 | 96c89a4a45 |
14 | 4c7519b701 |
15 | 296d56ce7b |
hex | 178bd31075 |
101130113141 has 2 divisors, whose sum is σ = 101130113142. Its totient is φ = 101130113140.
The previous prime is 101130113129. The next prime is 101130113173. The reversal of 101130113141 is 141311031101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80516332516 + 20613780625 = 283754^2 + 143575^2 .
It is a cyclic number.
It is not a de Polignac number, because 101130113141 - 234 = 83950243957 is a prime.
It is a super-2 number, since 2×1011301131412 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101130113101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50565056570 + 50565056571.
It is an arithmetic number, because the mean of its divisors is an integer number (50565056571).
Almost surely, 2101130113141 is an apocalyptic number.
It is an amenable number.
101130113141 is a deficient number, since it is larger than the sum of its proper divisors (1).
101130113141 is an equidigital number, since it uses as much as digits as its factorization.
101130113141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 101130113141 its reverse (141311031101), we get a palindrome (242441144242).
The spelling of 101130113141 in words is "one hundred one billion, one hundred thirty million, one hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •