Search a number
-
+
1151050051 = 2394816109
BaseRepresentation
bin100010010011011…
…1010000101000011
32222012220101211101
41010212322011003
54324132100201
6310114555231
740344523024
oct10446720503
92865811741
101151050051
11540812a38
12281598b17
13154616008
14acc2ac4b
156b0bbd01
hex449ba143

1151050051 has 4 divisors (see below), whose sum is σ = 1155866400. Its totient is φ = 1146233704.

The previous prime is 1151050027. The next prime is 1151050063. The reversal of 1151050051 is 1500501511.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 1151050051 - 219 = 1150525763 is a prime.

It is a Duffinian number.

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

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

Almost surely, 21151050051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4816348.

The product of its (nonzero) digits is 125, while the sum is 19.

The square root of 1151050051 is about 33927.1285404468. The cubic root of 1151050051 is about 1048.0083336920.

Adding to 1151050051 its reverse (1500501511), we get a palindrome (2651551562).

The spelling of 1151050051 in words is "one billion, one hundred fifty-one million, fifty thousand, fifty-one".

Divisors: 1 239 4816109 1151050051