Search a number
-
+
1151005051 = 72183112829
BaseRepresentation
bin100010010011010…
…1111000101111011
32222012211010002201
41010212233011323
54324124130201
6310114011031
740344244600
oct10446570573
92865733081
101151005051
11540792149
12281576a77
131545cb6a1
14acc186a7
156b0ad801
hex449af17b

1151005051 has 12 divisors (see below), whose sum is σ = 1339759920. Its totient is φ = 985960080.

The previous prime is 1151005039. The next prime is 1151005087. The reversal of 1151005051 is 1505001511.

It is a happy number.

It is a de Polignac number, because none of the positive numbers 2k-1151005051 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (1151009051) 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 11 ways as a sum of consecutive naturals, for example, 83305 + ... + 96133.

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

Almost surely, 21151005051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 14674 (or 14667 counting only the distinct ones).

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

The square root of 1151005051 is about 33926.4653478667. The cubic root of 1151005051 is about 1047.9946763103.

Adding to 1151005051 its reverse (1505001511), we get a palindrome (2656006562).

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

Divisors: 1 7 49 1831 12817 12829 89719 89803 628621 23489899 164429293 1151005051