Search a number
-
+
155064001 = 656323627
BaseRepresentation
bin10010011111000…
…01011011000001
3101210210001211011
421033201123001
5304144022001
623215320521
73562010431
oct1117413301
9353701734
10155064001
117a590974
1243b20141
1326182b61
14168462c1
15d92ed51
hex93e16c1

155064001 has 4 divisors (see below), whose sum is σ = 155094192. Its totient is φ = 155033812.

The previous prime is 155063971. The next prime is 155064023. The reversal of 155064001 is 100460551.

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 a cyclic number.

It is not a de Polignac number, because 155064001 - 25 = 155063969 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 2155064001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 30190.

The product of its (nonzero) digits is 600, while the sum is 22.

The square root of 155064001 is about 12452.4696747272. The cubic root of 155064001 is about 537.2424593497.

The spelling of 155064001 in words is "one hundred fifty-five million, sixty-four thousand, one".

Divisors: 1 6563 23627 155064001