Base | Representation |
---|---|
bin | 1101010110100… |
… | …00000110000110 |
3 | 21210202021001112 |
4 | 12223100012012 |
5 | 212133021124 |
6 | 15040325022 |
7 | 2526665510 |
oct | 653200606 |
9 | 253667045 |
10 | 112001414 |
11 | 58249358 |
12 | 31613772 |
13 | 1a286335 |
14 | 10c36bb0 |
15 | 9c7590e |
hex | 6ad0186 |
112001414 has 8 divisors (see below), whose sum is σ = 192002448. Its totient is φ = 48000600.
The previous prime is 112001413. The next prime is 112001441. The reversal of 112001414 is 414100211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 8000101 = 112001414 / (1 + 1 + 2 + 0 + 0 + 1 + 4 + 1 + 4).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112001413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4000037 + ... + 4000064.
It is an arithmetic number, because the mean of its divisors is an integer number (24000306).
Almost surely, 2112001414 is an apocalyptic number.
112001414 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
112001414 is a deficient number, since it is larger than the sum of its proper divisors (80001034).
112001414 is an equidigital number, since it uses as much as digits as its factorization.
112001414 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8000110.
The product of its (nonzero) digits is 32, while the sum is 14.
The square root of 112001414 is about 10583.0720492681. The cubic root of 112001414 is about 482.0304813629.
Adding to 112001414 its reverse (414100211), we get a palindrome (526101625).
The spelling of 112001414 in words is "one hundred twelve million, one thousand, four hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.224 sec. • engine limits •