Search a number
-
+
5305023410131 is a prime number
BaseRepresentation
bin100110100110010110000…
…0010010010111111010011
3200210011012012110211101101
41031030230002102333103
51143404141443111011
615141032154445231
71055163265653214
oct115145402227723
920704165424341
105305023410131
111765936460185
12718195733817
132c635285a0b3
14144a9bb2140b
1592ee0e0d2c1
hex4d32c092fd3

5305023410131 has 2 divisors, whose sum is σ = 5305023410132. Its totient is φ = 5305023410130.

The previous prime is 5305023410059. The next prime is 5305023410147. The reversal of 5305023410131 is 1310143205035.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 5305023410131 - 213 = 5305023401939 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 5305023410131.

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

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

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

Almost surely, 25305023410131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 5400, while the sum is 28.

Adding to 5305023410131 its reverse (1310143205035), we get a palindrome (6615166615166).

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