Search a number
-
+
1016132444641 is a prime number
BaseRepresentation
bin11101100100101100011…
…01101010000111100001
310121010211000110112011201
432302112031222013201
5113122014401212031
62054445500441201
7133261465161226
oct16622615520741
93533730415151
101016132444641
11361a37302376
12144b24849201
1374a89615182
1437276c1394d
151b672bbed61
hexec9636a1e1

1016132444641 has 2 divisors, whose sum is σ = 1016132444642. Its totient is φ = 1016132444640.

The previous prime is 1016132444629. The next prime is 1016132444659. The reversal of 1016132444641 is 1464442316101.

1016132444641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 879919041600 + 136213403041 = 938040^2 + 369071^2 .

It is a cyclic number.

It is not a de Polignac number, because 1016132444641 - 27 = 1016132444513 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1016132444641.

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

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

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

Almost surely, 21016132444641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 55296, while the sum is 37.

The spelling of 1016132444641 in words is "one trillion, sixteen billion, one hundred thirty-two million, four hundred forty-four thousand, six hundred forty-one".