Base | Representation |
---|---|
bin | 110110001010… |
… | …110100110011 |
3 | 222201102220012 |
4 | 312022310303 |
5 | 12113400430 |
6 | 1224205135 |
7 | 231461516 |
oct | 66126463 |
9 | 28642805 |
10 | 14200115 |
11 | 8019836 |
12 | 49097ab |
13 | 2c32547 |
14 | 1c58d7d |
15 | 13a7695 |
hex | d8ad33 |
14200115 has 4 divisors (see below), whose sum is σ = 17040144. Its totient is φ = 11360088.
The previous prime is 14200103. The next prime is 14200127. The reversal of 14200115 is 51100241.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 51100241 = 449 ⋅113809.
It is an interprime number because it is at equal distance from previous prime (14200103) and next prime (14200127).
It is a cyclic number.
It is not a de Polignac number, because 14200115 - 24 = 14200099 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14200115.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1420007 + ... + 1420016.
It is an arithmetic number, because the mean of its divisors is an integer number (4260036).
Almost surely, 214200115 is an apocalyptic number.
14200115 is a deficient number, since it is larger than the sum of its proper divisors (2840029).
14200115 is an equidigital number, since it uses as much as digits as its factorization.
14200115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2840028.
The product of its (nonzero) digits is 40, while the sum is 14.
The square root of 14200115 is about 3768.3039951681. The cubic root of 14200115 is about 242.1571447075.
Adding to 14200115 its reverse (51100241), we get a palindrome (65300356).
The spelling of 14200115 in words is "fourteen million, two hundred thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •