Search a number
-
+
1649013542641 is a prime number
BaseRepresentation
bin10111111111110000110…
…111011100111011110001
312211122101120220102111101
4113333300313130323301
5204004134431331031
63301314003044401
7230065043561563
oct27776067347361
95748346812441
101649013542641
11586385178523
1222770b370701
13bc6694baa8a
1459b53dd7333
152cd64570361
hex17ff0ddcef1

1649013542641 has 2 divisors, whose sum is σ = 1649013542642. Its totient is φ = 1649013542640.

The previous prime is 1649013542633. The next prime is 1649013542647. The reversal of 1649013542641 is 1462453109461.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1547685283600 + 101328259041 = 1244060^2 + 318321^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1649013542641 - 23 = 1649013542633 is a prime.

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

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

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

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

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

Almost surely, 21649013542641 is an apocalyptic number.

It is an amenable number.

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

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

1649013542641 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 622080, while the sum is 46.

The spelling of 1649013542641 in words is "one trillion, six hundred forty-nine billion, thirteen million, five hundred forty-two thousand, six hundred forty-one".