Search a number
-
+
1072175726801 is a prime number
BaseRepresentation
bin11111001101000101010…
…01110100000011010001
310210111110202210020102202
433212202221310003101
5120031303441224201
62140314542452545
7140314341210344
oct17464251640321
93714422706382
101072175726801
11383786278793
12153965594155
137a14b3c63aa
1439c71dbc45b
151cd52d9bc6b
hexf9a2a740d1

1072175726801 has 2 divisors, whose sum is σ = 1072175726802. Its totient is φ = 1072175726800.

The previous prime is 1072175726759. The next prime is 1072175726807. The reversal of 1072175726801 is 1086275712701.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 965296425025 + 106879301776 = 982495^2 + 326924^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1072175726801 is a prime.

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

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

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

Almost surely, 21072175726801 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 329280, while the sum is 47.

The spelling of 1072175726801 in words is "one trillion, seventy-two billion, one hundred seventy-five million, seven hundred twenty-six thousand, eight hundred one".