Base | Representation |
---|---|
bin | 110100101011100010… |
… | …1111001010101001000 |
3 | 101211000020122100120210 |
4 | 1221113011321111020 |
5 | 3323142330004112 |
6 | 123545451121120 |
7 | 11113321536342 |
oct | 1512705712510 |
9 | 354006570523 |
10 | 113130313032 |
11 | 43a84126680 |
12 | 19b131431a0 |
13 | a88bba9539 |
14 | 5692c2c292 |
15 | 2e21d2cb3c |
hex | 1a57179548 |
113130313032 has 128 divisors (see below), whose sum is σ = 326850629760. Its totient is φ = 32249118720.
The previous prime is 113130313001. The next prime is 113130313067. The reversal of 113130313032 is 230313031311.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11093728 + ... + 11103920.
It is an arithmetic number, because the mean of its divisors is an integer number (2553520545).
Almost surely, 2113130313032 is an apocalyptic number.
113130313032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 113130313032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163425314880).
113130313032 is an abundant number, since it is smaller than the sum of its proper divisors (213720316728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113130313032 is a wasteful number, since it uses less digits than its factorization.
113130313032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12703 (or 12699 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 113130313032 its reverse (230313031311), we get a palindrome (343443344343).
The spelling of 113130313032 in words is "one hundred thirteen billion, one hundred thirty million, three hundred thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •