Search a number
-
+
1300210354981 is a prime number
BaseRepresentation
bin10010111010111010100…
…100111000101100100101
311121022001220011121000101
4102322322210320230211
5132300312322324411
62433150340144101
7162636265444246
oct22727244705445
94538056147011
101300210354981
11461463937a8a
1218bba5998031
13957bc868a45
1446d054a4ccd
1523c4c6278c1
hex12eba938b25

1300210354981 has 2 divisors, whose sum is σ = 1300210354982. Its totient is φ = 1300210354980.

The previous prime is 1300210354979. The next prime is 1300210355111. The reversal of 1300210354981 is 1894530120031.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1040043030625 + 260167324356 = 1019825^2 + 510066^2 .

It is a cyclic number.

It is not a de Polignac number, because 1300210354981 - 21 = 1300210354979 is a prime.

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

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

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

It is a congruent number.

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

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

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

Almost surely, 21300210354981 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 25920, while the sum is 37.

The spelling of 1300210354981 in words is "one trillion, three hundred billion, two hundred ten million, three hundred fifty-four thousand, nine hundred eighty-one".