Search a number
-
+
1950796238761 is a prime number
BaseRepresentation
bin11100011000110100100…
…001000100111110101001
320220111100100021210120201
4130120310201010332221
5223430212314120021
64052103341352201
7260640356302066
oct34306441047651
96814310253521
101950796238761
1169236768a7a7
122760b1868661
13111c6175b556
146a5c1bc9c6d
1535b284ba591
hex1c634844fa9

1950796238761 has 2 divisors, whose sum is σ = 1950796238762. Its totient is φ = 1950796238760.

The previous prime is 1950796238719. The next prime is 1950796238821. The reversal of 1950796238761 is 1678326970591.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1004767669161 + 946028569600 = 1002381^2 + 972640^2 .

It is a cyclic number.

It is not a de Polignac number, because 1950796238761 - 215 = 1950796205993 is a prime.

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

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

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

Almost surely, 21950796238761 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 34292160, while the sum is 64.

The spelling of 1950796238761 in words is "one trillion, nine hundred fifty billion, seven hundred ninety-six million, two hundred thirty-eight thousand, seven hundred sixty-one".