Search a number
-
+
69151681 is a prime number
BaseRepresentation
bin1000001111100…
…10101111000001
311211010021021101
410013302233001
5120200323211
610510054401
71466531254
oct407625701
9154107241
1069151681
1136041755
121b1aa401
1311432671
14928109b
15610e5c1
hex41f2bc1

69151681 has 2 divisors, whose sum is σ = 69151682. Its totient is φ = 69151680.

The previous prime is 69151673. The next prime is 69151703. The reversal of 69151681 is 18615196.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 47389456 + 21762225 = 6884^2 + 4665^2 .

It is a cyclic number.

It is not a de Polignac number, because 69151681 - 23 = 69151673 is a prime.

It is a super-2 number, since 2×691516812 = 9563909970251522, which contains 22 as substring.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 69151681.

It is not a weakly prime, because it can be changed into another prime (69151081) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 34575840 + 34575841.

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

Almost surely, 269151681 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 12960, while the sum is 37.

The square root of 69151681 is about 8315.7489740853. The cubic root of 69151681 is about 410.4569187224.

The spelling of 69151681 in words is "sixty-nine million, one hundred fifty-one thousand, six hundred eighty-one".