Base | Representation |
---|---|
bin | 1101101001111… |
… | …00001111011011 |
3 | 21222112022102221 |
4 | 12310330033123 |
5 | 213310312111 |
6 | 15211004511 |
7 | 2560405216 |
oct | 664741733 |
9 | 258468387 |
10 | 114541531 |
11 | 59723825 |
12 | 32439737 |
13 | 1a965570 |
14 | 112d877d |
15 | a0c8371 |
hex | 6d3c3db |
114541531 has 8 divisors (see below), whose sum is σ = 125090784. Its totient is φ = 104240640.
The previous prime is 114541517. The next prime is 114541543. The reversal of 114541531 is 135145411.
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 114541531 - 25 = 114541499 is a prime.
It is a super-2 number, since 2×1145415312 = 26239524647647922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114541496 and 114541505.
It is not an unprimeable number, because it can be changed into a prime (114541831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61126 + ... + 62971.
It is an arithmetic number, because the mean of its divisors is an integer number (15636348).
Almost surely, 2114541531 is an apocalyptic number.
114541531 is a deficient number, since it is larger than the sum of its proper divisors (10549253).
114541531 is a wasteful number, since it uses less digits than its factorization.
114541531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124181.
The product of its digits is 1200, while the sum is 25.
The square root of 114541531 is about 10702.4077197610. The cubic root of 114541531 is about 485.6473178928.
Adding to 114541531 its reverse (135145411), we get a palindrome (249686942).
The spelling of 114541531 in words is "one hundred fourteen million, five hundred forty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •