Base | Representation |
---|---|
bin | 11001110100001111010011… |
… | …000011001100111000011011 |
3 | 112220000102011121012200210002 |
4 | 121310033103003030320123 |
5 | 104340223432313122111 |
6 | 1041252003234443215 |
7 | 32626031600125466 |
oct | 3164172303147033 |
9 | 486012147180702 |
10 | 113541001301531 |
11 | 331a5517255031 |
12 | 1089900b73350b |
13 | 4b47b415a609b |
14 | 20075b15d42dd |
15 | d1d6de40d63b |
hex | 6743d30cce1b |
113541001301531 has 2 divisors, whose sum is σ = 113541001301532. Its totient is φ = 113541001301530.
The previous prime is 113541001301503. The next prime is 113541001301647. The reversal of 113541001301531 is 135103100145311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 113541001301531 - 238 = 113266123394587 is a prime.
It is a super-2 number, since 2×1135410013015312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113541001301494 and 113541001301503.
It is not a weakly prime, because it can be changed into another prime (113541091301531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56770500650765 + 56770500650766.
It is an arithmetic number, because the mean of its divisors is an integer number (56770500650766).
Almost surely, 2113541001301531 is an apocalyptic number.
113541001301531 is a deficient number, since it is larger than the sum of its proper divisors (1).
113541001301531 is an equidigital number, since it uses as much as digits as its factorization.
113541001301531 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2700, while the sum is 29.
Adding to 113541001301531 its reverse (135103100145311), we get a palindrome (248644101446842).
The spelling of 113541001301531 in words is "one hundred thirteen trillion, five hundred forty-one billion, one million, three hundred one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •