Search a number
-
+
155056509641 = 1114096046331
BaseRepresentation
bin1001000001101000010…
…1101001001011001001
3112211020011011211002102
42100122011221023021
510020023431302031
6155122035043145
714126305404605
oct2203205511311
9484204154072
10155056509641
115a8393a2740
12260741404b5
13118110353b7
14770d162505
1540779997cb
hex241a1692c9

155056509641 has 4 divisors (see below), whose sum is σ = 169152555984. Its totient is φ = 140960463300.

The previous prime is 155056509623. The next prime is 155056509653. The reversal of 155056509641 is 146905650551.

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 155056509641 - 210 = 155056508617 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2155056509641 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 14096046342.

The product of its (nonzero) digits is 810000, while the sum is 47.

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

Divisors: 1 11 14096046331 155056509641