Search a number
-
+
3123020223041 is a prime number
BaseRepresentation
bin101101011100100010100…
…000101101001001000001
3102001120001122112010002012
4231130202200231021001
5402131421134114131
610350410133502305
7441426231620345
oct55344240551101
912046048463065
103123020223041
11aa45135540a4
124253191a1995
1319866565c5a4
14ab2253cb625
155638493552b
hex2d72282d241

3123020223041 has 2 divisors, whose sum is σ = 3123020223042. Its totient is φ = 3123020223040.

The previous prime is 3123020222899. The next prime is 3123020223049. The reversal of 3123020223041 is 1403220203213.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1819760530225 + 1303259692816 = 1348985^2 + 1141604^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-3123020223041 is a prime.

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

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

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

Almost surely, 23123020223041 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1728, while the sum is 23.

Adding to 3123020223041 its reverse (1403220203213), we get a palindrome (4526240426254).

The spelling of 3123020223041 in words is "three trillion, one hundred twenty-three billion, twenty million, two hundred twenty-three thousand, forty-one".