Base | Representation |
---|---|
bin | 110100110010011011… |
… | …0000001010101110001 |
3 | 101211121022210010021112 |
4 | 1221210312001111301 |
5 | 3324130411020221 |
6 | 124024412203105 |
7 | 11122122610130 |
oct | 1514466012561 |
9 | 354538703245 |
10 | 113361032561 |
11 | 44092390677 |
12 | 19b78469495 |
13 | a8c792b17a |
14 | 56b5729917 |
15 | 2e3720415b |
hex | 1a64d81571 |
113361032561 has 64 divisors (see below), whose sum is σ = 143472384000. Its totient is φ = 87373209600.
The previous prime is 113361032549. The next prime is 113361032671. The reversal of 113361032561 is 165230163311.
It is a cyclic number.
It is not a de Polignac number, because 113361032561 - 26 = 113361032497 is a prime.
It is a super-2 number, since 2×1133610325612 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (113361035561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 41235815 + ... + 41238563.
It is an arithmetic number, because the mean of its divisors is an integer number (2241756000).
Almost surely, 2113361032561 is an apocalyptic number.
It is an amenable number.
113361032561 is a deficient number, since it is larger than the sum of its proper divisors (30111351439).
113361032561 is a wasteful number, since it uses less digits than its factorization.
113361032561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2994.
The product of its (nonzero) digits is 9720, while the sum is 32.
Adding to 113361032561 its reverse (165230163311), we get a palindrome (278591195872).
The spelling of 113361032561 in words is "one hundred thirteen billion, three hundred sixty-one million, thirty-two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •