Search a number
-
+
153630650065 = 5158811934773
BaseRepresentation
bin1000111100010100011…
…0011010111011010001
3112200112210011122110111
42033011012122323101
510004113421300230
6154324342001321
714046052656604
oct2170506327321
9480483148414
10153630650065
115a1775512a2
1225936716241
13116448013c9
147615a3c33b
153ee26e792a
hex23c519aed1

153630650065 has 8 divisors (see below), whose sum is σ = 184368484008. Its totient is φ = 122896717440.

The previous prime is 153630650011. The next prime is 153630650087. The reversal of 153630650065 is 560056036351.

153630650065 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 4 ways, for example, as 11193851601 + 142436798464 = 105801^2 + 377408^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 153630650065 - 219 = 153630125777 is a prime.

It is a Duffinian number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 887982 + ... + 1046791.

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

Almost surely, 2153630650065 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1950659.

The product of its (nonzero) digits is 243000, while the sum is 40.

The spelling of 153630650065 in words is "one hundred fifty-three billion, six hundred thirty million, six hundred fifty thousand, sixty-five".

Divisors: 1 5 15881 79405 1934773 9673865 30726130013 153630650065