Search a number
-
+
67080131 is a prime number
BaseRepresentation
bin1111111111100…
…0111111000011
311200020000122022
43333320333003
5114133031011
610353432055
71443112616
oct377707703
9150200568
1067080131
1134957328
121a56b62b
1310b887b1
148ca217d
155d508db
hex3ff8fc3

67080131 has 2 divisors, whose sum is σ = 67080132. Its totient is φ = 67080130.

The previous prime is 67080107. The next prime is 67080157. The reversal of 67080131 is 13108076.

It is an a-pointer prime, because the next prime (67080157) can be obtained adding 67080131 to its sum of digits (26).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 67080131 - 210 = 67079107 is a prime.

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

It is a Chen prime.

It is equal to p3956201 and since 67080131 and 3956201 have the same sum of digits, it is a Honaker prime.

It is a zygodrome in base 2.

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

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

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

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

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

Almost surely, 267080131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1008, while the sum is 26.

The square root of 67080131 is about 8190.2460890989. The cubic root of 67080131 is about 406.3166639004.

The spelling of 67080131 in words is "sixty-seven million, eighty thousand, one hundred thirty-one".