Base | Representation |
---|---|
bin | 1101101000010… |
… | …00001001001101 |
3 | 21222010110201121 |
4 | 12310020021031 |
5 | 213232000031 |
6 | 15202240541 |
7 | 2555526124 |
oct | 664101115 |
9 | 258113647 |
10 | 114328141 |
11 | 59598474 |
12 | 32356151 |
13 | 1a8bc3b5 |
14 | 11280abb |
15 | a085011 |
hex | 6d0824d |
114328141 has 4 divisors (see below), whose sum is σ = 114361884. Its totient is φ = 114294400.
The previous prime is 114328139. The next prime is 114328153. The reversal of 114328141 is 141823411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 141823411 = 347 ⋅408713.
It can be written as a sum of positive squares in 2 ways, for example, as 89378116 + 24950025 = 9454^2 + 4995^2 .
It is a cyclic number.
It is not a de Polignac number, because 114328141 - 21 = 114328139 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114328171) 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, 11140 + ... + 18781.
It is an arithmetic number, because the mean of its divisors is an integer number (28590471).
Almost surely, 2114328141 is an apocalyptic number.
It is an amenable number.
114328141 is a deficient number, since it is larger than the sum of its proper divisors (33743).
114328141 is an equidigital number, since it uses as much as digits as its factorization.
114328141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33742.
The product of its digits is 768, while the sum is 25.
The square root of 114328141 is about 10692.4338202301. The cubic root of 114328141 is about 485.3455446631.
The spelling of 114328141 in words is "one hundred fourteen million, three hundred twenty-eight thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •