Search a number
-
+
1072272515351 is a prime number
BaseRepresentation
bin11111001101010000110…
…11000010000100010111
310210111201111220121100212
433212220123002010113
5120032003230442401
62140332321200035
7140316624665612
oct17465033020427
93714644817325
101072272515351
11383825976424
12153991a9001b
137a16548421b
1439c80bb5179
151cd5b619dbb
hexf9a86c2117

1072272515351 has 2 divisors, whose sum is σ = 1072272515352. Its totient is φ = 1072272515350.

The previous prime is 1072272515323. The next prime is 1072272515359. The reversal of 1072272515351 is 1535152722701.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1072272515351 - 230 = 1071198773527 is a prime.

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

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

Almost surely, 21072272515351 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 147000, while the sum is 41.

The spelling of 1072272515351 in words is "one trillion, seventy-two billion, two hundred seventy-two million, five hundred fifteen thousand, three hundred fifty-one".