Search a number
-
+
114050335251 = 3139273502003
BaseRepresentation
bin110101000110111101…
…1100000001000010011
3101220101100211022210210
41222031323200020103
53332033341212001
6124221034255203
711145162566016
oct1521573401023
9356340738723
10114050335251
1144406493a16
121a12b287503
13a9a7693498
14573d0bb37d
152e779b1dd6
hex1a8dee0213

114050335251 has 8 divisors (see below), whose sum is σ = 153161122240. Its totient is φ = 75486552552.

The previous prime is 114050335193. The next prime is 114050335279. The reversal of 114050335251 is 152533050411.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 114050335251 - 217 = 114050204179 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2114050335251 is an apocalyptic number.

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

114050335251 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 273502145.

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

Adding to 114050335251 its reverse (152533050411), we get a palindrome (266583385662).

The spelling of 114050335251 in words is "one hundred fourteen billion, fifty million, three hundred thirty-five thousand, two hundred fifty-one".

Divisors: 1 3 139 417 273502003 820506009 38016778417 114050335251