Search a number
-
+
1831653665057 is a prime number
BaseRepresentation
bin11010101001110111000…
…100001110100100100001
320111002211002111221211202
4122221313010032210201
5220002211314240212
63521241114450545
7246222041160566
oct32516704164441
96432732457752
101831653665057
11646888819757
12256ba1133a55
131039550b2728
146491c6ba86d
15329a39320c2
hex1aa7710e921

1831653665057 has 2 divisors, whose sum is σ = 1831653665058. Its totient is φ = 1831653665056.

The previous prime is 1831653664879. The next prime is 1831653665071. The reversal of 1831653665057 is 7505663561381.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1647626392801 + 184027272256 = 1283599^2 + 428984^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1831653665057 - 28 = 1831653664801 is a prime.

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

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

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

Almost surely, 21831653665057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13608000, while the sum is 56.

The spelling of 1831653665057 in words is "one trillion, eight hundred thirty-one billion, six hundred fifty-three million, six hundred sixty-five thousand, fifty-seven".