Search a number
-
+
1063386863131 = 9971066586623
BaseRepresentation
bin11110111100101101100…
…10111101011000011011
310202122210020222201000111
433132112302331120123
5114410304014110011
62132302502545151
7136553501125165
oct17362662753033
93678706881014
101063386863131
1137aa8618639a
121521121381b7
137937a5cc248
143967aa47935
151c9db4c9121
hexf796cbd61b

1063386863131 has 4 divisors (see below), whose sum is σ = 1064453450752. Its totient is φ = 1062320275512.

The previous prime is 1063386863113. The next prime is 1063386863137. The reversal of 1063386863131 is 1313686833601.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 1063386863131 - 213 = 1063386854939 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (1063386863137) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 533292315 + ... + 533294308.

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

Almost surely, 21063386863131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1066587620.

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

The spelling of 1063386863131 in words is "one trillion, sixty-three billion, three hundred eighty-six million, eight hundred sixty-three thousand, one hundred thirty-one".

Divisors: 1 997 1066586623 1063386863131