Base | Representation |
---|---|
bin | 11001110100001010000001… |
… | …110110110011100011001011 |
3 | 112212222212120100020121200212 |
4 | 121310022001312303203023 |
5 | 104340130341044132001 |
6 | 1041245230025551335 |
7 | 32625441445015661 |
oct | 3164120166634313 |
9 | 485885510217625 |
10 | 113535344130251 |
11 | 331a30839a056a |
12 | 10897ab104554b |
13 | 4b4744c552364 |
14 | 20071d6146c31 |
15 | d1d4ac9447bb |
hex | 674281db38cb |
113535344130251 has 2 divisors, whose sum is σ = 113535344130252. Its totient is φ = 113535344130250.
The previous prime is 113535344130217. The next prime is 113535344130337. The reversal of 113535344130251 is 152031443535311.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113535344130251 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113535344130199 and 113535344130208.
It is not a weakly prime, because it can be changed into another prime (113535344120251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56767672065125 + 56767672065126.
It is an arithmetic number, because the mean of its divisors is an integer number (56767672065126).
Almost surely, 2113535344130251 is an apocalyptic number.
113535344130251 is a deficient number, since it is larger than the sum of its proper divisors (1).
113535344130251 is an equidigital number, since it uses as much as digits as its factorization.
113535344130251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 41.
Adding to 113535344130251 its reverse (152031443535311), we get a palindrome (265566787665562).
The spelling of 113535344130251 in words is "one hundred thirteen trillion, five hundred thirty-five billion, three hundred forty-four million, one hundred thirty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •