Search a number
-
+
155064666361 = 1114096787851
BaseRepresentation
bin1001000001101010010…
…0110000100011111001
3112211020201112020000011
42100122210300203321
510020033023310421
6155122525541521
714126434626253
oct2203244604371
9484221466004
10155064666361
115a842a63a30
1226076a148a1
131181292cc67
147710286cd3
15407855b4e1
hex241a9308f9

155064666361 has 4 divisors (see below), whose sum is σ = 169161454224. Its totient is φ = 140967878500.

The previous prime is 155064666347. The next prime is 155064666377. The reversal of 155064666361 is 163666460551.

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 155064666361 - 25 = 155064666329 is a prime.

It is a super-3 number, since 3×1550646663613 (a number of 35 digits) contains 333 as substring.

It is a Duffinian number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7048393915 + ... + 7048393936.

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

Almost surely, 2155064666361 is an apocalyptic number.

155064666361 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

155064666361 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 14096787862.

The product of its (nonzero) digits is 2332800, while the sum is 49.

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

Divisors: 1 11 14096787851 155064666361