Search a number
-
+
1151050033 = 733355831
BaseRepresentation
bin100010010011011…
…1010000100110001
32222012220101210201
41010212322010301
54324132100113
6310114555201
740344523000
oct10446720461
92865811721
101151050033
11540812a21
12281598b01
13154615cc3
14acc2ac37
156b0bbcdd
hex449ba131

1151050033 has 8 divisors (see below), whose sum is σ = 1342332800. Its totient is φ = 986614020.

The previous prime is 1151050027. The next prime is 1151050063. The reversal of 1151050033 is 3300501511.

It is not a de Polignac number, because 1151050033 - 213 = 1151041841 is a prime.

It is a Duffinian number.

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

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

Almost surely, 21151050033 is an apocalyptic number.

It is an amenable number.

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

1151050033 is an frugal number, since it uses more digits than its factorization.

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

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

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

The square root of 1151050033 is about 33927.1282751724. The cubic root of 1151050033 is about 1048.0083282291.

Adding to 1151050033 its reverse (3300501511), we get a palindrome (4451551544).

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

Divisors: 1 7 49 343 3355831 23490817 164435719 1151050033