Search a number
-
+
3095900591051 is a prime number
BaseRepresentation
bin101101000011010010000…
…011100001001111001011
3101221222001122011001210202
4231003102003201033023
5401210401022403201
610330123114002415
7436446205555022
oct55032203411713
911858048131722
103095900591051
11a93a671a01a4
1242000aa1640b
13195c32c53478
14a9bb17278b9
15557e8b1dc6b
hex2d0d20e13cb

3095900591051 has 2 divisors, whose sum is σ = 3095900591052. Its totient is φ = 3095900591050.

The previous prime is 3095900590943. The next prime is 3095900591081. The reversal of 3095900591051 is 1501950095903.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-3095900591051 is a prime.

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

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

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

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

Almost surely, 23095900591051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 273375, while the sum is 47.

The spelling of 3095900591051 in words is "three trillion, ninety-five billion, nine hundred million, five hundred ninety-one thousand, fifty-one".