Search a number
-
+
1477047741601 is a prime number
BaseRepresentation
bin10101011111100110111…
…001111110110010100001
312020012111222220121022011
4111133212321332302201
5143144443210212401
63050314003112521
7211466422436215
oct25374671766241
95205458817264
101477047741601
1151a459a419a3
121ba318372741
13a9392201913
14516bd248945
152864c36a451
hex157e6e7eca1

1477047741601 has 2 divisors, whose sum is σ = 1477047741602. Its totient is φ = 1477047741600.

The previous prime is 1477047741581. The next prime is 1477047741613. The reversal of 1477047741601 is 1061477407741.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1288222730001 + 188825011600 = 1134999^2 + 434540^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1477047741601 - 217 = 1477047610529 is a prime.

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

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

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

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

Almost surely, 21477047741601 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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