Search a number
-
+
667151413469 is a prime number
BaseRepresentation
bin10011011010101010101…
…00101011000011011101
32100210000221002022020222
421231111110223003131
541412311230212334
61230252442051125
766125430306452
oct11552524530335
92323027068228
10667151413469
11237a34642422
12a936b7a9aa5
134abb1b959a8
142440c829829
151254a347d2e
hex9b5552b0dd

667151413469 has 2 divisors, whose sum is σ = 667151413470. Its totient is φ = 667151413468.

The previous prime is 667151413429. The next prime is 667151413541. The reversal of 667151413469 is 964314151766.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 594271392100 + 72880021369 = 770890^2 + 269963^2 .

It is a cyclic number.

It is not a de Polignac number, because 667151413469 - 28 = 667151413213 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2667151413469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 3265920, while the sum is 53.

The spelling of 667151413469 in words is "six hundred sixty-seven billion, one hundred fifty-one million, four hundred thirteen thousand, four hundred sixty-nine".