Search a number
-
+
15461014169 is a prime number
BaseRepresentation
bin11100110011000110…
…00101101010011001
31110220111121220020102
432121203011222121
5223131004423134
611034103105145
71055065311026
oct163143055231
943814556212
1015461014169
116614380867
122bb5a421b5
1315c52010c3
14a6954c54d
1560752b37e
hex3998c5a99

15461014169 has 2 divisors, whose sum is σ = 15461014170. Its totient is φ = 15461014168.

The previous prime is 15461014147. The next prime is 15461014181. The reversal of 15461014169 is 96141016451.

15461014169 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 13488499600 + 1972514569 = 116140^2 + 44413^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-15461014169 is a prime.

It is a super-2 number, since 2×154610141692 (a number of 21 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (15461016169) 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 as a sum of consecutive naturals, namely, 7730507084 + 7730507085.

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

Almost surely, 215461014169 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25920, while the sum is 38.

The spelling of 15461014169 in words is "fifteen billion, four hundred sixty-one million, fourteen thousand, one hundred sixty-nine".