Search a number
-
+
7371149823013 is a prime number
BaseRepresentation
bin110101101000011101011…
…0001000100110000100101
3222002200020002211111122111
41223100322301010300211
51431232103323314023
623402132014201021
71360355651465104
oct153207261046045
928080202744574
107371149823013
1123920a5a00769
129b06b31b3171
13416133b78212
141b6aa097c03b
15cbb193e700d
hex6b43ac44c25

7371149823013 has 2 divisors, whose sum is σ = 7371149823014. Its totient is φ = 7371149823012.

The previous prime is 7371149822963. The next prime is 7371149823031. The reversal of 7371149823013 is 3103289411737.

It is a happy number.

Together with next prime (7371149823031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6765294636324 + 605855186689 = 2601018^2 + 778367^2 .

It is a cyclic number.

It is not a de Polignac number, because 7371149823013 - 233 = 7362559888421 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 27371149823013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 762048, while the sum is 49.

The spelling of 7371149823013 in words is "seven trillion, three hundred seventy-one billion, one hundred forty-nine million, eight hundred twenty-three thousand, thirteen".