Base | Representation |
---|---|
bin | 1101011110011… |
… | …10111101001010 |
3 | 21212201022000210 |
4 | 12233032331022 |
5 | 212414422242 |
6 | 15114541550 |
7 | 2541604125 |
oct | 657167512 |
9 | 255638023 |
10 | 113045322 |
11 | 588a1695 |
12 | 31a378b6 |
13 | 1a560530 |
14 | 110293bc |
15 | 9dced9c |
hex | 6bcef4a |
113045322 has 64 divisors (see below), whose sum is σ = 258483456. Its totient is φ = 32693760.
The previous prime is 113045321. The next prime is 113045329. The reversal of 113045322 is 223540311.
It is a super-3 number, since 3×1130453223 (a number of 25 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (113045321) 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 31 ways as a sum of consecutive naturals, for example, 108918 + ... + 109950.
It is an arithmetic number, because the mean of its divisors is an integer number (4038804).
Almost surely, 2113045322 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 113045322, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (129241728).
113045322 is an abundant number, since it is smaller than the sum of its proper divisors (145438134).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113045322 is a wasteful number, since it uses less digits than its factorization.
113045322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1135.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 113045322 is about 10632.2773665852. The cubic root of 113045322 is about 483.5234392350.
Adding to 113045322 its reverse (223540311), we get a palindrome (336585633).
The spelling of 113045322 in words is "one hundred thirteen million, forty-five thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •