Search a number
-
+
6130347413 is a prime number
BaseRepresentation
bin1011011010110010…
…11010110110010101
3120211020022220201012
411231121122312111
5100023332104123
62452150342005
7304626043661
oct55531326625
916736286635
106130347413
11266646a823
12123105a905
137690a6708
1442225d8a1
1525d2d4378
hex16d65ad95

6130347413 has 2 divisors, whose sum is σ = 6130347414. Its totient is φ = 6130347412.

The previous prime is 6130347403. The next prime is 6130347467. The reversal of 6130347413 is 3147430316.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3205484689 + 2924862724 = 56617^2 + 54082^2 .

It is a cyclic number.

It is not a de Polignac number, because 6130347413 - 226 = 6063238549 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 26130347413 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 18144, while the sum is 32.

The square root of 6130347413 is about 78296.5351276798. The cubic root of 6130347413 is about 1830.1851577909.

Adding to 6130347413 its reverse (3147430316), we get a palindrome (9277777729).

The spelling of 6130347413 in words is "six billion, one hundred thirty million, three hundred forty-seven thousand, four hundred thirteen".