Search a number
-
+
156055919601 = 352018639867
BaseRepresentation
bin1001000101010110101…
…0000101101111110001
3112220210210202002211010
42101111222011233301
510024100303411401
6155405135541133
714163132300351
oct2212552055761
9486723662733
10156055919601
116020155318a
12262b298a7a9
13119400c6b3a
1477a5b98b61
1540d55b0ed6
hex2455a85bf1

156055919601 has 4 divisors (see below), whose sum is σ = 208074559472. Its totient is φ = 104037279732.

The previous prime is 156055919557. The next prime is 156055919623. The reversal of 156055919601 is 106919550651.

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

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 not a de Polignac number, because 156055919601 - 213 = 156055911409 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (156055919101) by changing a digit.

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 3 ways as a sum of consecutive naturals, for example, 26009319931 + ... + 26009319936.

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

Almost surely, 2156055919601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 52018639870.

The product of its (nonzero) digits is 364500, while the sum is 48.

The spelling of 156055919601 in words is "one hundred fifty-six billion, fifty-five million, nine hundred nineteen thousand, six hundred one".

Divisors: 1 3 52018639867 156055919601