Search a number
-
+
1151126051 = 2699374567
BaseRepresentation
bin100010010011100…
…1100101000100011
32222020001021002012
41010213030220203
54324142013201
6310120343135
740345260425
oct10447145043
92866037065
101151126051
11540865049
12281614aab
1315464179a
14acc4a815
156b0d45bb
hex449cca23

1151126051 has 8 divisors (see below), whose sum is σ = 1156891680. Its totient is φ = 1145371968.

The previous prime is 1151126023. The next prime is 1151126071. The reversal of 1151126051 is 1506211511.

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

It is a cyclic number.

It is not a de Polignac number, because 1151126051 - 230 = 77384227 is a prime.

It is a Duffinian number.

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

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

Almost surely, 21151126051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5773.

The product of its (nonzero) digits is 300, while the sum is 23.

The square root of 1151126051 is about 33928.2485695917. The cubic root of 1151126051 is about 1048.0313986839.

Adding to 1151126051 its reverse (1506211511), we get a palindrome (2657337562).

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

Divisors: 1 269 937 4567 252053 1228523 4279279 1151126051