Base | Representation |
---|---|
bin | 110100110111001100… |
… | …0110010101100000100 |
3 | 101212000111001112212110 |
4 | 1221232120302230010 |
5 | 3324442403030112 |
6 | 124052332021020 |
7 | 11126105535060 |
oct | 1515630625404 |
9 | 355014045773 |
10 | 113521142532 |
11 | 441647a8666 |
12 | 1a002001770 |
13 | a921b599b5 |
14 | 56ccac6aa0 |
15 | 2e462ce13c |
hex | 1a6e632b04 |
113521142532 has 96 divisors (see below), whose sum is σ = 304316393472. Its totient is φ = 32264176896.
The previous prime is 113521142503. The next prime is 113521142569. The reversal of 113521142532 is 235241125311.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 113521142532.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 26752803 + ... + 26757045.
It is an arithmetic number, because the mean of its divisors is an integer number (3169962432).
Almost surely, 2113521142532 is an apocalyptic number.
113521142532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
113521142532 is an abundant number, since it is smaller than the sum of its proper divisors (190795250940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113521142532 is a wasteful number, since it uses less digits than its factorization.
113521142532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5857 (or 5855 counting only the distinct ones).
The product of its digits is 7200, while the sum is 30.
Adding to 113521142532 its reverse (235241125311), we get a palindrome (348762267843).
The spelling of 113521142532 in words is "one hundred thirteen billion, five hundred twenty-one million, one hundred forty-two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •