Search a number
-
+
1246910198113 is a prime number
BaseRepresentation
bin10010001001010001101…
…000111011000101100001
311102012111022112002020101
4102021101220323011201
5130412133002314423
62352453404542401
7156041411544016
oct22112150730541
94365438462211
101246910198113
114408a2333268
121817ab851a01
1390777190498
14444ca75770d
152267d19d7ad
hex12251a3b161

1246910198113 has 2 divisors, whose sum is σ = 1246910198114. Its totient is φ = 1246910198112.

The previous prime is 1246910198063. The next prime is 1246910198123. The reversal of 1246910198113 is 3118910196421.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1234569876544 + 12340321569 = 1111112^2 + 111087^2 .

It is a cyclic number.

It is not a de Polignac number, because 1246910198113 - 221 = 1246908100961 is a prime.

It is a super-3 number, since 3×12469101981133 (a number of 37 digits) contains 333 as substring.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 21246910198113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 93312, while the sum is 46.

The spelling of 1246910198113 in words is "one trillion, two hundred forty-six billion, nine hundred ten million, one hundred ninety-eight thousand, one hundred thirteen".