Search a number
-
+
1072152768637 is a prime number
BaseRepresentation
bin11111001101000010100…
…10001111000001111101
310210111102011120211202101
433212201102033001331
5120031232102044022
62140312402425101
7140313642111046
oct17464122170175
93714364524671
101072152768637
113837743179a5
12153959962191
137a146718692
1439c6cd238cd
151cd50d64627
hexf9a148f07d

1072152768637 has 2 divisors, whose sum is σ = 1072152768638. Its totient is φ = 1072152768636.

The previous prime is 1072152768559. The next prime is 1072152768727. The reversal of 1072152768637 is 7368672512701.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 863005698361 + 209147070276 = 928981^2 + 457326^2 .

It is a cyclic number.

It is not a de Polignac number, because 1072152768637 - 215 = 1072152735869 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 21072152768637 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5927040, while the sum is 55.

The spelling of 1072152768637 in words is "one trillion, seventy-two billion, one hundred fifty-two million, seven hundred sixty-eight thousand, six hundred thirty-seven".