Search a number
-
+
2056029899969 is a prime number
BaseRepresentation
bin11101111010110100111…
…011101000110011000001
321021112222020222200022102
4131322310323220303001
5232141222123244334
64212305504120145
7301354223540063
oct35726473506301
97245866880272
102056029899969
11722a59306a41
12292580306055
1311bb6263b436
1471725d73733
1538736e1467e
hex1deb4ee8cc1

2056029899969 has 2 divisors, whose sum is σ = 2056029899970. Its totient is φ = 2056029899968.

The previous prime is 2056029899909. The next prime is 2056029900079. The reversal of 2056029899969 is 9699989206502.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1697061160369 + 358968739600 = 1302713^2 + 599140^2 .

It is a cyclic number.

It is not a de Polignac number, because 2056029899969 - 228 = 2055761464513 is a prime.

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

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

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

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

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

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

Almost surely, 22056029899969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 340122240, while the sum is 74.

The spelling of 2056029899969 in words is "two trillion, fifty-six billion, twenty-nine million, eight hundred ninety-nine thousand, nine hundred sixty-nine".