Search a number
-
+
114857013 = 338285671
BaseRepresentation
bin1101101100010…
…01010000110101
322000010100012110
412312021100311
5213400411023
615221441233
72563161045
oct666112065
9260110173
10114857013
1159919857
1232570219
131aa4603b
141137b725
15a13ba93
hex6d89435

114857013 has 4 divisors (see below), whose sum is σ = 153142688. Its totient is φ = 76571340.

The previous prime is 114857003. The next prime is 114857027. The reversal of 114857013 is 310758411.

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: 310758411 = 3103586137.

It is not a de Polignac number, because 114857013 - 210 = 114855989 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (114857003) 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, 19142833 + ... + 19142838.

It is an arithmetic number, because the mean of its divisors is an integer number (38285672).

Almost surely, 2114857013 is an apocalyptic number.

It is an amenable number.

114857013 is a deficient number, since it is larger than the sum of its proper divisors (38285675).

114857013 is an equidigital number, since it uses as much as digits as its factorization.

114857013 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 38285674.

The product of its (nonzero) digits is 3360, while the sum is 30.

The square root of 114857013 is about 10717.1364179057. The cubic root of 114857013 is about 486.0927823332.

The spelling of 114857013 in words is "one hundred fourteen million, eight hundred fifty-seven thousand, thirteen".

Divisors: 1 3 38285671 114857013