Base | Representation |
---|---|
bin | 1101011000000… |
… | …11111111111111 |
3 | 21211011001200122 |
4 | 12230003333333 |
5 | 212211322030 |
6 | 15045045155 |
7 | 2531542364 |
oct | 654037777 |
9 | 254131618 |
10 | 112214015 |
11 | 58384061 |
12 | 316b67bb |
13 | 1a32c034 |
14 | 10c9046b |
15 | 9cb88e5 |
hex | 6b03fff |
112214015 has 8 divisors (see below), whose sum is σ = 134827728. Its totient is φ = 89657280.
The previous prime is 112213993. The next prime is 112214041. The reversal of 112214015 is 510412211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112214015 - 26 = 112213951 is a prime.
It is a super-4 number, since 4×1122140154 (a number of 33 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112213984 and 112214002.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 9782 + ... + 17891.
It is an arithmetic number, because the mean of its divisors is an integer number (16853466).
Almost surely, 2112214015 is an apocalyptic number.
112214015 is a deficient number, since it is larger than the sum of its proper divisors (22613713).
112214015 is an equidigital number, since it uses as much as digits as its factorization.
112214015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28489.
The product of its (nonzero) digits is 80, while the sum is 17.
The square root of 112214015 is about 10593.1116769342. Note that the first 3 decimals coincide. The cubic root of 112214015 is about 482.3352852174.
Adding to 112214015 its reverse (510412211), we get a palindrome (622626226).
The spelling of 112214015 in words is "one hundred twelve million, two hundred fourteen thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •