Base | Representation |
---|---|
bin | 1101011111110… |
… | …01011000111010 |
3 | 21220001010110010 |
4 | 12233321120322 |
5 | 212441003010 |
6 | 15122402350 |
7 | 2543226633 |
oct | 657713072 |
9 | 256033403 |
10 | 113219130 |
11 | 58a00232 |
12 | 31b003b6 |
13 | 1a5c168b |
14 | 1107288a |
15 | 9e16620 |
hex | 6bf963a |
113219130 has 64 divisors (see below), whose sum is σ = 285907968. Its totient is φ = 28654080.
The previous prime is 113219089. The next prime is 113219159. The reversal of 113219130 is 31912311.
It is a junction number, because it is equal to n+sod(n) for n = 113219097 and 113219106.
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, 48142 + ... + 50438.
It is an arithmetic number, because the mean of its divisors is an integer number (4467312).
Almost surely, 2113219130 is an apocalyptic number.
113219130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 113219130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142953984).
113219130 is an abundant number, since it is smaller than the sum of its proper divisors (172688838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113219130 is a wasteful number, since it uses less digits than its factorization.
113219130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2391.
The product of its (nonzero) digits is 162, while the sum is 21.
The square root of 113219130 is about 10640.4478289215. The cubic root of 113219130 is about 483.7711192697.
The spelling of 113219130 in words is "one hundred thirteen million, two hundred nineteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •