Search a number
-
+
408066012506947 is a prime number
BaseRepresentation
bin101110011001000100100010…
…1101110000110101101000011
31222111211201201000211022201211
41130302021011232012231003
5411441223143200210242
64003514534352110551
7151644540124665214
oct13462110556065503
91874751630738654
10408066012506947
1110902790788a3a3
1239925b15b35457
13146905c94267c2
1472aa7010c340b
153229b005a0317
hex1732245b86b43

408066012506947 has 2 divisors, whose sum is σ = 408066012506948. Its totient is φ = 408066012506946.

The previous prime is 408066012506939. The next prime is 408066012506993. The reversal of 408066012506947 is 749605210660804.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 408066012506947 - 23 = 408066012506939 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 408066012506891 and 408066012506900.

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

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

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

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

Almost surely, 2408066012506947 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 17418240, while the sum is 58.

The spelling of 408066012506947 in words is "four hundred eight trillion, sixty-six billion, twelve million, five hundred six thousand, nine hundred forty-seven".