Search a number
-
+
15069386681 is a prime number
BaseRepresentation
bin11100000100011010…
…01001011110111001
31102220012201011022122
432002031021132321
5221330230333211
610531153131025
71042301446646
oct160215113671
942805634278
1015069386681
116433304288
122b06859a75
13156203166b
14a2d526dcd
155d2e6d6db
hex3823497b9

15069386681 has 2 divisors, whose sum is σ = 15069386682. Its totient is φ = 15069386680.

The previous prime is 15069386671. The next prime is 15069386699. The reversal of 15069386681 is 18668396051.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 14476902400 + 592484281 = 120320^2 + 24341^2 .

It is a cyclic number.

It is not a de Polignac number, because 15069386681 - 210 = 15069385657 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (15069386611) 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, 7534693340 + 7534693341.

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

Almost surely, 215069386681 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1866240, while the sum is 53.

The spelling of 15069386681 in words is "fifteen billion, sixty-nine million, three hundred eighty-six thousand, six hundred eighty-one".