Search a number
-
+
10442948671513 is a prime number
BaseRepresentation
bin1001011111110111000000…
…1111101111100000011001
31100222100002001022012012201
42113331300033233200121
52332044124324442023
634113231400210201
72125323001052131
oct227756017574031
940870061265181
1010442948671513
113366914306a66
121207ab6469961
135a99c56cb657
14281627343ac1
151319a2128bad
hex97f703ef819

10442948671513 has 2 divisors, whose sum is σ = 10442948671514. Its totient is φ = 10442948671512.

The previous prime is 10442948671499. The next prime is 10442948671537. The reversal of 10442948671513 is 31517684924401.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8070076460944 + 2372872210569 = 2840788^2 + 1540413^2 .

It is a cyclic number.

It is not a de Polignac number, because 10442948671513 - 25 = 10442948671481 is a prime.

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

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

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

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

Almost surely, 210442948671513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5806080, while the sum is 55.

The spelling of 10442948671513 in words is "ten trillion, four hundred forty-two billion, nine hundred forty-eight million, six hundred seventy-one thousand, five hundred thirteen".