1056151700101 has 2 divisors, whose sum is σ = 1056151700102. Its totient is φ = 1056151700100.

The previous prime is 1056151700069. The next prime is 1056151700119. The reversal of 1056151700101 is 1010071516501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 672186816900 + 383964883201 = 819870^2 + 619649^2 .

It is a cyclic number.

It is not a de Polignac number, because 1056151700101 - 2⁵ = 1056151700069 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 2^{1056151700101} is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1050, while the sum is 28.

The spelling of 1056151700101 in words is "one trillion, fifty-six billion, one hundred fifty-one million, seven hundred thousand, one hundred one".