Search a number
-
+
10283724374813 is a prime number
BaseRepresentation
bin1001010110100101110110…
…1111010000001100011101
31100102010002102200212002122
42111221131233100030131
52321442031414443223
633512135555032325
72110655163626441
oct225513557201435
940363072625078
1010283724374813
11330533734a20a
1211a107a59b6a5
1359799c088886
14277a40872821
1512c7838145c8
hex95a5dbd031d

10283724374813 has 2 divisors, whose sum is σ = 10283724374814. Its totient is φ = 10283724374812.

The previous prime is 10283724374809. The next prime is 10283724374851. The reversal of 10283724374813 is 31847342738201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5313776456569 + 4969947918244 = 2305163^2 + 2229338^2 .

It is a cyclic number.

It is not a de Polignac number, because 10283724374813 - 22 = 10283724374809 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (10283724374113) 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, 5141862187406 + 5141862187407.

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

Almost surely, 210283724374813 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5419008, while the sum is 53.

The spelling of 10283724374813 in words is "ten trillion, two hundred eighty-three billion, seven hundred twenty-four million, three hundred seventy-four thousand, eight hundred thirteen".