Search a number
-
+
123615605051251 is a prime number
BaseRepresentation
bin11100000110110110000000…
…001110100100111101110011
3121012200112111001120002211221
4130012312000032210331303
5112200304224343120001
61114524120333045511
735015634634063435
oct3406660016447563
9535615431502757
10123615605051251
113642a0a1443455
1211a45648026897
1353c8b948a9bc1
142275054930655
15e457d3be61a1
hex706d803a4f73

123615605051251 has 2 divisors, whose sum is σ = 123615605051252. Its totient is φ = 123615605051250.

The previous prime is 123615605051207. The next prime is 123615605051293. The reversal of 123615605051251 is 152150506516321.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 123615605051251 - 219 = 123615604526963 is a prime.

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

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

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

Almost surely, 2123615605051251 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 270000, while the sum is 43.

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