Base | Representation |
---|---|
bin | 1101101010000… |
… | …00010001011001 |
3 | 21222120011002102 |
4 | 12311000101121 |
5 | 213311324131 |
6 | 15211213145 |
7 | 2560504313 |
oct | 665002131 |
9 | 258504072 |
10 | 114558041 |
11 | 59735174 |
12 | 324471b5 |
13 | 1a96cc30 |
14 | 113007b3 |
15 | a0cd1cb |
hex | 6d40459 |
114558041 has 8 divisors (see below), whose sum is σ = 124757640. Its totient is φ = 104556672.
The previous prime is 114558023. The next prime is 114558043. The reversal of 114558041 is 140855411.
It can be written as a sum of positive squares in 4 ways, for example, as 14137600 + 100420441 = 3760^2 + 10021^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114558041 - 214 = 114541657 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114557995 and 114558013.
It is not an unprimeable number, because it can be changed into a prime (114558043) 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 7 ways as a sum of consecutive naturals, for example, 48350 + ... + 50663.
It is an arithmetic number, because the mean of its divisors is an integer number (15594705).
Almost surely, 2114558041 is an apocalyptic number.
It is an amenable number.
114558041 is a deficient number, since it is larger than the sum of its proper divisors (10199599).
114558041 is an equidigital number, since it uses as much as digits as its factorization.
114558041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99115.
The product of its (nonzero) digits is 3200, while the sum is 29.
The square root of 114558041 is about 10703.1790137323. The cubic root of 114558041 is about 485.6706504836.
The spelling of 114558041 in words is "one hundred fourteen million, five hundred fifty-eight thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •