Search a number
-
+
1063637113639 is a prime number
BaseRepresentation
bin11110111101001011011…
…01100101101100100111
310202200102200212202011211
433132211231211230213
5114411312100114024
62132343402412251
7136562630202412
oct17364555455447
93680380782154
101063637113639
113800a44702a1
12152181b01087
13793ba3cb979
14396a1d8ab79
151ca0345c594
hexf7a5b65b27

1063637113639 has 2 divisors, whose sum is σ = 1063637113640. Its totient is φ = 1063637113638.

The previous prime is 1063637113619. The next prime is 1063637113673. The reversal of 1063637113639 is 9363117363601.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1063637113639 - 215 = 1063637080871 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 21063637113639 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1102248, while the sum is 49.

The spelling of 1063637113639 in words is "one trillion, sixty-three billion, six hundred thirty-seven million, one hundred thirteen thousand, six hundred thirty-nine".