Base | Representation |
---|---|
bin | 1101100101110… |
… | …11010010000010 |
3 | 21221112110212100 |
4 | 12302323102002 |
5 | 213141411224 |
6 | 15151411230 |
7 | 2553045222 |
oct | 662732202 |
9 | 257473770 |
10 | 114013314 |
11 | 593a2988 |
12 | 32223b16 |
13 | 1a80bccc |
14 | 111dc082 |
15 | a021ac9 |
hex | 6cbb482 |
114013314 has 12 divisors (see below), whose sum is σ = 247028886. Its totient is φ = 38004432.
The previous prime is 114013313. The next prime is 114013349. The reversal of 114013314 is 413310411.
It can be written as a sum of positive squares in only one way, i.e., 78907689 + 35105625 = 8883^2 + 5925^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 6334073 = 114013314 / (1 + 1 + 4 + 0 + 1 + 3 + 3 + 1 + 4).
It is not an unprimeable number, because it can be changed into a prime (114013313) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 3167019 + ... + 3167054.
Almost surely, 2114013314 is an apocalyptic number.
114013314 is an abundant number, since it is smaller than the sum of its proper divisors (133015572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114013314 is a wasteful number, since it uses less digits than its factorization.
114013314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6334081 (or 6334078 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 114013314 is about 10677.7017190030. The cubic root of 114013314 is about 484.8996341720.
Adding to 114013314 its reverse (413310411), we get a palindrome (527323725).
The spelling of 114013314 in words is "one hundred fourteen million, thirteen thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •