Base | Representation |
---|---|
bin | 1101100110001… |
… | …01010100100101 |
3 | 21221121120021102 |
4 | 12303011110211 |
5 | 213144220222 |
6 | 15152325445 |
7 | 2553306140 |
oct | 663052445 |
9 | 257546242 |
10 | 114054437 |
11 | 59420872 |
12 | 32243885 |
13 | 1a824943 |
14 | 1120d057 |
15 | a02dd92 |
hex | 6cc5525 |
114054437 has 4 divisors (see below), whose sum is σ = 130347936. Its totient is φ = 97760940.
The previous prime is 114054431. The next prime is 114054449. The reversal of 114054437 is 734450411.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 734450411 = 10009 ⋅73379.
It is a cyclic number.
It is not a de Polignac number, because 114054437 - 28 = 114054181 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 (114054431) 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 3 ways as a sum of consecutive naturals, for example, 8146739 + ... + 8146752.
It is an arithmetic number, because the mean of its divisors is an integer number (32586984).
Almost surely, 2114054437 is an apocalyptic number.
It is an amenable number.
114054437 is a deficient number, since it is larger than the sum of its proper divisors (16293499).
114054437 is an equidigital number, since it uses as much as digits as its factorization.
114054437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16293498.
The product of its (nonzero) digits is 6720, while the sum is 29.
The square root of 114054437 is about 10679.6271938678. The cubic root of 114054437 is about 484.9579259920.
The spelling of 114054437 in words is "one hundred fourteen million, fifty-four thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •