Search a number
-
+
1053152133 = 31160153101
BaseRepresentation
bin111110110001011…
…101001110000101
32201101200200010120
4332301131032011
54124101332013
6252300412153
735045434245
oct7661351605
92641620116
101053152133
114a0527870
12254847059
1313a25a257
149dc25b25
15626d0123
hex3ec5d385

1053152133 has 16 divisors (see below), whose sum is σ = 1534435392. Its totient is φ = 637200000.

The previous prime is 1053152059. The next prime is 1053152143. The reversal of 1053152133 is 3312513501.

It is not a de Polignac number, because 1053152133 - 28 = 1053151877 is a prime.

It is a super-2 number, since 2×10531521332 = 2218258830484899378, which contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 21053152133 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 53716.

The product of its (nonzero) digits is 1350, while the sum is 24.

The square root of 1053152133 is about 32452.3055113192. The cubic root of 1053152133 is about 1017.4124253379.

Adding to 1053152133 its reverse (3312513501), we get a palindrome (4365665634).

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

Divisors: 1 3 11 33 601 1803 6611 19833 53101 159303 584111 1752333 31913701 95741103 351050711 1053152133