Base | Representation |
---|---|
bin | 1101010110111… |
… | …11011111101010 |
3 | 21210212110120200 |
4 | 12223133133222 |
5 | 212142030430 |
6 | 15041533030 |
7 | 2530350426 |
oct | 653373752 |
9 | 253773520 |
10 | 112064490 |
11 | 5829178a |
12 | 31644176 |
13 | 1a2a8c65 |
14 | 10c51b86 |
15 | 9c89460 |
hex | 6adf7ea |
112064490 has 96 divisors (see below), whose sum is σ = 303999696. Its totient is φ = 28615680.
The previous prime is 112064479. The next prime is 112064507. The reversal of 112064490 is 94460211.
112064490 is a `hidden beast` number, since 1 + 12 + 0 + 644 + 9 + 0 = 666.
It can be written as a sum of positive squares in 8 ways, for example, as 67026969 + 45037521 = 8187^2 + 6711^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 242860 + ... + 243320.
Almost surely, 2112064490 is an apocalyptic number.
112064490 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 112064490, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151999848).
112064490 is an abundant number, since it is smaller than the sum of its proper divisors (191935206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112064490 is a wasteful number, since it uses less digits than its factorization.
112064490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 584 (or 581 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 112064490 is about 10586.0516718935. The cubic root of 112064490 is about 482.1209529849.
The spelling of 112064490 in words is "one hundred twelve million, sixty-four thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •