Search a number
-
+
15361311161 = 72194473023
BaseRepresentation
bin11100100111001101…
…10000000110111001
31110122120000110102102
432103212300012321
5222424443424121
611020142113145
71052444663510
oct162346600671
943576013372
1015361311161
116573072489
122b8857b7b5
1315aa662841
14a5a1d7677
155ed8d490b
hex3939b01b9

15361311161 has 4 divisors (see below), whose sum is σ = 17555784192. Its totient is φ = 13166838132.

The previous prime is 15361311157. The next prime is 15361311179. The reversal of 15361311161 is 16111316351.

15361311161 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 15361311161 - 22 = 15361311157 is a prime.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 215361311161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2194473030.

The product of its digits is 1620, while the sum is 29.

The spelling of 15361311161 in words is "fifteen billion, three hundred sixty-one million, three hundred eleven thousand, one hundred sixty-one".

Divisors: 1 7 2194473023 15361311161