Search a number
-
+
3063714630439 is a prime number
BaseRepresentation
bin101100100101010011100…
…111110100101100100111
3101211212222112120212012111
4230211103213310230213
5400143441421133224
610303241233101451
7434226463452121
oct54452347645447
911755875525174
103063714630439
11a81350046651
124159279b7887
13192ba3a34068
14a83dac58211
1554a6314cd94
hex2c9539f4b27

3063714630439 has 2 divisors, whose sum is σ = 3063714630440. Its totient is φ = 3063714630438.

The previous prime is 3063714630437. The next prime is 3063714630463. The reversal of 3063714630439 is 9340364173603.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 3063714630439 - 21 = 3063714630437 is a prime.

Together with 3063714630437, it forms a pair of twin primes.

It is a junction number, because it is equal to n+sod(n) for n = 3063714630392 and 3063714630401.

It is a congruent number.

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

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

Almost surely, 23063714630439 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2939328, while the sum is 49.

The spelling of 3063714630439 in words is "three trillion, sixty-three billion, seven hundred fourteen million, six hundred thirty thousand, four hundred thirty-nine".