Base | Representation |
---|---|
bin | 1101101000011… |
… | …10100011111111 |
3 | 21222011210210022 |
4 | 12310032203333 |
5 | 213233320211 |
6 | 15203002355 |
7 | 2555665562 |
oct | 664164377 |
9 | 258153708 |
10 | 114354431 |
11 | 596061a4 |
12 | 323693bb |
13 | 1a8cb359 |
14 | 1128a4d9 |
15 | a08cbdb |
hex | 6d0e8ff |
114354431 has 8 divisors (see below), whose sum is σ = 117884160. Its totient is φ = 110870488.
The previous prime is 114354421. The next prime is 114354437. The reversal of 114354431 is 134453411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114354431 is a prime.
It is a super-2 number, since 2×1143544312 = 26153871778667522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114354431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114354437) 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, 6341 + ... + 16398.
It is an arithmetic number, because the mean of its divisors is an integer number (14735520).
Almost surely, 2114354431 is an apocalyptic number.
114354431 is a deficient number, since it is larger than the sum of its proper divisors (3529729).
114354431 is a wasteful number, since it uses less digits than its factorization.
114354431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22893.
The product of its digits is 2880, while the sum is 26.
The square root of 114354431 is about 10693.6631235513. The cubic root of 114354431 is about 485.3827438931.
The spelling of 114354431 in words is "one hundred fourteen million, three hundred fifty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •