Search a number
-
+
1153301061 = 311199917483
BaseRepresentation
bin100010010111101…
…1111101001000101
32222101010202122010
41010233133221011
54330221113221
6310235124433
740402616523
oct10457375105
92871122563
101153301061
11542010180
122822a3719
13154c23783
14ad255313
156b3b3c76
hex44bdfa45

1153301061 has 16 divisors (see below), whose sum is σ = 1678464000. Its totient is φ = 698580720.

The previous prime is 1153301059. The next prime is 1153301077. The reversal of 1153301061 is 1601033511.

It is not a de Polignac number, because 1153301061 - 21 = 1153301059 is a prime.

It is a congruent number.

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

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

Almost surely, 21153301061 is an apocalyptic number.

1153301061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 19496.

The product of its (nonzero) digits is 270, while the sum is 21.

The square root of 1153301061 is about 33960.2865270598. The cubic root of 1153301061 is about 1048.6910555512.

Adding to 1153301061 its reverse (1601033511), we get a palindrome (2754334572).

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

Divisors: 1 3 11 33 1999 5997 17483 21989 52449 65967 192313 576939 34948517 104845551 384433687 1153301061