Base | Representation |
---|---|
bin | 11001101111111001001110… |
… | …010001110000111100110011 |
3 | 112211221212111000201010121211 |
4 | 121233321032101300330303 |
5 | 104320330434234144011 |
6 | 1040502503334500551 |
7 | 32565331521364444 |
oct | 3157711621607463 |
9 | 484855430633554 |
10 | 113242421006131 |
11 | 3309a92848591a |
12 | 1084b181804757 |
13 | 4b25939934a91 |
14 | 1dd6d68c532cb |
15 | d15a666d7b21 |
hex | 66fe4e470f33 |
113242421006131 has 2 divisors, whose sum is σ = 113242421006132. Its totient is φ = 113242421006130.
The previous prime is 113242421006089. The next prime is 113242421006167. The reversal of 113242421006131 is 131600124242311.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 113242421006131 - 213 = 113242420997939 is a prime.
It is a super-2 number, since 2×1132424210061312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113242421006093 and 113242421006102.
It is not a weakly prime, because it can be changed into another prime (113242421006171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56621210503065 + 56621210503066.
It is an arithmetic number, because the mean of its divisors is an integer number (56621210503066).
Almost surely, 2113242421006131 is an apocalyptic number.
113242421006131 is a deficient number, since it is larger than the sum of its proper divisors (1).
113242421006131 is an equidigital number, since it uses as much as digits as its factorization.
113242421006131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 31.
Adding to 113242421006131 its reverse (131600124242311), we get a palindrome (244842545248442).
The spelling of 113242421006131 in words is "one hundred thirteen trillion, two hundred forty-two billion, four hundred twenty-one million, six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •