Search a number
-
+
1151105001 = 3383701667
BaseRepresentation
bin100010010011100…
…0111011111101001
32222020000012012120
41010213013133221
54324140330001
6310120101453
740345142154
oct10447073751
92866005176
101151105001
11540850252
12281604889
13154635027
14acc42c9b
156b0cd236
hex449c77e9

1151105001 has 4 divisors (see below), whose sum is σ = 1534806672. Its totient is φ = 767403332.

The previous prime is 1151104993. The next prime is 1151105057. The reversal of 1151105001 is 1005011511.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 1151105001 - 23 = 1151104993 is a prime.

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

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

Almost surely, 21151105001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 383701670.

The product of its (nonzero) digits is 25, while the sum is 15.

The square root of 1151105001 is about 33927.9383546952. The cubic root of 1151105001 is about 1048.0250103898.

Adding to 1151105001 its reverse (1005011511), we get a palindrome (2156116512).

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

Divisors: 1 3 383701667 1151105001