Search a number
-
+
2300050275121 is a prime number
BaseRepresentation
bin100001011110000101101…
…011011111101100110001
322010212211110101010012201
4201132011223133230301
5300141000332300441
64520343431423201
7325113250522204
oct41360553375461
98125743333181
102300050275121
1180749a466575
12311922224b01
13138b80916671
147d47455b93b
153ec69cbcc31
hex21785adfb31

2300050275121 has 2 divisors, whose sum is σ = 2300050275122. Its totient is φ = 2300050275120.

The previous prime is 2300050275011. The next prime is 2300050275143. The reversal of 2300050275121 is 1215720500032.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1933668238096 + 366382037025 = 1390564^2 + 605295^2 .

It is a cyclic number.

It is not a de Polignac number, because 2300050275121 - 213 = 2300050266929 is a prime.

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

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

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

Almost surely, 22300050275121 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 2300050275121 its reverse (1215720500032), we get a palindrome (3515770775153).

The spelling of 2300050275121 in words is "two trillion, three hundred billion, fifty million, two hundred seventy-five thousand, one hundred twenty-one".