Search a number
-
+
405646381920467 is a prime number
BaseRepresentation
bin101110000111011101110100…
…0011111111011000011010011
31222012021102012210222222121102
41130032323220133323003103
5411132102242232423332
63554423213015215015
7151304661332233442
oct13416735037730323
91865242183888542
10405646381920467
11108284734462026
12395b4ba067746b
131454639c56bb6c
14722556526ad59
1531d6bd75ce062
hex170eee87fb0d3

405646381920467 has 2 divisors, whose sum is σ = 405646381920468. Its totient is φ = 405646381920466.

The previous prime is 405646381920463. The next prime is 405646381920557. The reversal of 405646381920467 is 764029183646504.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 405646381920467 - 22 = 405646381920463 is a prime.

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

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

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅405646381920467 = 811292763840934 is not.

Almost surely, 2405646381920467 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 209018880, while the sum is 65.

The spelling of 405646381920467 in words is "four hundred five trillion, six hundred forty-six billion, three hundred eighty-one million, nine hundred twenty thousand, four hundred sixty-seven".