Search a number
-
+
10420663046531 is a prime number
BaseRepresentation
bin1001011110100011111111…
…1010110101000110000011
31100220012112220222010220212
42113220333322311012003
52331213004214442111
634055104142024335
72123603513264423
oct227507772650603
940805486863825
1010420663046531
113358418695081
121203716b780ab
135a78836428ca
14280511692483
151310ea8ca98b
hex97a3feb5183

10420663046531 has 2 divisors, whose sum is σ = 10420663046532. Its totient is φ = 10420663046530.

The previous prime is 10420663046513. The next prime is 10420663046543. The reversal of 10420663046531 is 13564036602401.

Together with previous prime (10420663046513) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is an emirp because it is prime and its reverse (13564036602401) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10420663046531 is a prime.

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

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

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

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

Almost surely, 210420663046531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 311040, while the sum is 41.

Adding to 10420663046531 its reverse (13564036602401), we get a palindrome (23984699648932).

The spelling of 10420663046531 in words is "ten trillion, four hundred twenty billion, six hundred sixty-three million, forty-six thousand, five hundred thirty-one".