Base | Representation |
---|---|
bin | 1101100110000… |
… | …00111100111101 |
3 | 21221120122201121 |
4 | 12303000330331 |
5 | 213143132131 |
6 | 15152110541 |
7 | 2553203023 |
oct | 663007475 |
9 | 257518647 |
10 | 114036541 |
11 | 59409383 |
12 | 32235451 |
13 | 1a819758 |
14 | 11206713 |
15 | a028911 |
hex | 6cc0f3d |
114036541 has 4 divisors (see below), whose sum is σ = 114126300. Its totient is φ = 113946784.
The previous prime is 114036521. The next prime is 114036589. The reversal of 114036541 is 145630411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 145630411 = 23 ⋅6331757.
It can be written as a sum of positive squares in 2 ways, for example, as 100420441 + 13616100 = 10021^2 + 3690^2 .
It is a cyclic number.
It is not a de Polignac number, because 114036541 - 25 = 114036509 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 (114036521) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42946 + ... + 45523.
It is an arithmetic number, because the mean of its divisors is an integer number (28531575).
Almost surely, 2114036541 is an apocalyptic number.
It is an amenable number.
114036541 is a deficient number, since it is larger than the sum of its proper divisors (89759).
114036541 is an equidigital number, since it uses as much as digits as its factorization.
114036541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89758.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 114036541 is about 10678.7893040363. The cubic root of 114036541 is about 484.9325601485.
Adding to 114036541 its reverse (145630411), we get a palindrome (259666952).
The spelling of 114036541 in words is "one hundred fourteen million, thirty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •