Search a number
-
+
3000466102541 is a prime number
BaseRepresentation
bin101011101010011001101…
…101110101100100001101
3101121211201122022201221012
4223222121231311210031
5343124423310240131
610214221201415005
7426530230030445
oct53523155654415
911554648281835
103000466102541
11a57543990496
1240561603a465
13189c3427701b
14a531ab87125
15530b061352b
hex2ba99b7590d

3000466102541 has 2 divisors, whose sum is σ = 3000466102542. Its totient is φ = 3000466102540.

The previous prime is 3000466102511. The next prime is 3000466102567. The reversal of 3000466102541 is 1452016640003.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2530755997225 + 469710105316 = 1590835^2 + 685354^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

Almost surely, 23000466102541 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17280, while the sum is 32.

The spelling of 3000466102541 in words is "three trillion, four hundred sixty-six million, one hundred two thousand, five hundred forty-one".