Search a number
-
+
155894361313 = 160797009559
BaseRepresentation
bin1001000100110000000…
…1110010110011100001
3112220101112202002111211
42101030001302303201
510023232424030223
6155341125110121
714156131131055
oct2211401626341
9486345662454
10155894361313
1160129337039
1226268858341
13119157ac012
14778c541c65
1540c62ebd0d
hex244c072ce1

155894361313 has 4 divisors (see below), whose sum is σ = 155991372480. Its totient is φ = 155797350148.

The previous prime is 155894361289. The next prime is 155894361319. The reversal of 155894361313 is 313163498551.

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, and also an emirpimes, since its reverse is a distinct semiprime: 313163498551 = 417638134111.

It is a cyclic number.

It is not a de Polignac number, because 155894361313 - 25 = 155894361281 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2155894361313 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 97011166.

The product of its digits is 1166400, while the sum is 49.

The spelling of 155894361313 in words is "one hundred fifty-five billion, eight hundred ninety-four million, three hundred sixty-one thousand, three hundred thirteen".

Divisors: 1 1607 97009559 155894361313