Base | Representation |
---|---|
bin | 1101100001001… |
… | …10000011010110 |
3 | 21220101102101200 |
4 | 12300212003112 |
5 | 213012331240 |
6 | 15130333330 |
7 | 2544621165 |
oct | 660460326 |
9 | 256342350 |
10 | 113402070 |
11 | 59015721 |
12 | 31b8a246 |
13 | 1a656a22 |
14 | 110bd3dc |
15 | 9e50930 |
hex | 6c260d6 |
113402070 has 192 divisors, whose sum is σ = 339655680. Its totient is φ = 26072064.
The previous prime is 113402059. The next prime is 113402099. The reversal of 113402070 is 70204311.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1366249 + ... + 1366331.
It is an arithmetic number, because the mean of its divisors is an integer number (1769040).
Almost surely, 2113402070 is an apocalyptic number.
113402070 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 113402070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (169827840).
113402070 is an abundant number, since it is smaller than the sum of its proper divisors (226253610).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113402070 is a wasteful number, since it uses less digits than its factorization.
113402070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 179 (or 176 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 18.
The square root of 113402070 is about 10649.0408018751. The cubic root of 113402070 is about 484.0315389370.
Adding to 113402070 its reverse (70204311), we get a palindrome (183606381).
The spelling of 113402070 in words is "one hundred thirteen million, four hundred two thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •