Base | Representation |
---|---|
bin | 1101100100011… |
… | …00010101101000 |
3 | 21221011201002210 |
4 | 12302030111220 |
5 | 213114233112 |
6 | 15143325120 |
7 | 2551314513 |
oct | 662142550 |
9 | 257151083 |
10 | 113821032 |
11 | 59281476 |
12 | 321507a0 |
13 | 1a772630 |
14 | 1118bd7a |
15 | 9ed4b3c |
hex | 6c8c568 |
113821032 has 64 divisors (see below), whose sum is σ = 309960000. Its totient is φ = 34619904.
The previous prime is 113821009. The next prime is 113821033. The reversal of 113821032 is 230128311.
It is not an unprimeable number, because it can be changed into a prime (113821033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25719 + ... + 29817.
It is an arithmetic number, because the mean of its divisors is an integer number (4843125).
Almost surely, 2113821032 is an apocalyptic number.
113821032 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 113821032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154980000).
113821032 is an abundant number, since it is smaller than the sum of its proper divisors (196138968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113821032 is a wasteful number, since it uses less digits than its factorization.
113821032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4210 (or 4206 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
The square root of 113821032 is about 10668.6940156703. The cubic root of 113821032 is about 484.6268884375.
Adding to 113821032 its reverse (230128311), we get a palindrome (343949343).
The spelling of 113821032 in words is "one hundred thirteen million, eight hundred twenty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •