Search a number
-
+
1473653643041 is a prime number
BaseRepresentation
bin10101011100011100100…
…110100001011100100001
312012212202110022112101002
4111130130212201130201
5143121020313034131
63044553115521345
7211316340201146
oct25343446413441
95185673275332
101473653643041
11518a78077468
121b972b759255
13a8c70c93c88
145147a5763cd
15284ee3cb6cb
hex1571c9a1721

1473653643041 has 2 divisors, whose sum is σ = 1473653643042. Its totient is φ = 1473653643040.

The previous prime is 1473653643019. The next prime is 1473653643053. The reversal of 1473653643041 is 1403463563741.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1452979516816 + 20674126225 = 1205396^2 + 143785^2 .

It is an emirp because it is prime and its reverse (1403463563741) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1473653643041 - 26 = 1473653642977 is a prime.

It is a super-2 number, since 2×14736536430412 (a number of 25 digits) contains 22 as substring.

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

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

Almost surely, 21473653643041 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2177280, while the sum is 47.

The spelling of 1473653643041 in words is "one trillion, four hundred seventy-three billion, six hundred fifty-three million, six hundred forty-three thousand, forty-one".