Search a number
-
+
153664051 = 732104987
BaseRepresentation
bin10010010100010…
…11101000110011
3101201010221110011
421022023220303
5303314222201
623125315351
73544060102
oct1112135063
9351127404
10153664051
1179815092
1243565b57
1325ab2898
14165a0039
15d755151
hex928ba33

153664051 has 4 divisors (see below), whose sum is σ = 155769112. Its totient is φ = 151558992.

The previous prime is 153664033. The next prime is 153664057. The reversal of 153664051 is 150466351.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-153664051 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 2153664051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2105060.

The product of its (nonzero) digits is 10800, while the sum is 31.

The square root of 153664051 is about 12396.1304849538. The cubic root of 153664051 is about 535.6207904325.

The spelling of 153664051 in words is "one hundred fifty-three million, six hundred sixty-four thousand, fifty-one".

Divisors: 1 73 2104987 153664051