Base | Representation |
---|---|
bin | 110100101010101001… |
… | …1011011000010010100 |
3 | 101210221011011202122212 |
4 | 1221111103123002110 |
5 | 3323112134221112 |
6 | 123542500012552 |
7 | 11112505504115 |
oct | 1512523330224 |
9 | 353834152585 |
10 | 113100304532 |
11 | 43a6919a866 |
12 | 19b05091158 |
13 | a885900727 |
14 | 568cc5a20c |
15 | 2e1e3a1522 |
hex | 1a554db094 |
113100304532 has 12 divisors (see below), whose sum is σ = 197942136756. Its totient is φ = 56545408320.
The previous prime is 113100304523. The next prime is 113100304591. The reversal of 113100304532 is 235403001311.
It can be written as a sum of positive squares in 2 ways, for example, as 55636543876 + 57463760656 = 235874^2 + 239716^2 .
It is a super-2 number, since 2×1131003045322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113100304498 and 113100304507.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 1132073 + ... + 1227920.
It is an arithmetic number, because the mean of its divisors is an integer number (16495178063).
Almost surely, 2113100304532 is an apocalyptic number.
It is an amenable number.
113100304532 is a deficient number, since it is larger than the sum of its proper divisors (84841832224).
113100304532 is a wasteful number, since it uses less digits than its factorization.
113100304532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2371978 (or 2371976 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 113100304532 its reverse (235403001311), we get a palindrome (348503305843).
The spelling of 113100304532 in words is "one hundred thirteen billion, one hundred million, three hundred four thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •