Search a number
-
+
1355364651063 = 31582328552627
BaseRepresentation
bin10011101110010010000…
…001110101000000110111
311210120102200201010122010
4103232102001311000313
5134201241322313223
62514351304135303
7166631125306263
oct23562201650067
94716380633563
101355364651063
11482897013a65
1219a818a67533
139aa6c40b7b7
144985857d0a3
15253c9751393
hex13b92075037

1355364651063 has 8 divisors (see below), whose sum is σ = 1807267141888. Its totient is φ = 903519297144.

The previous prime is 1355364651019. The next prime is 1355364651077. The reversal of 1355364651063 is 3601564635531.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 1355364651063 - 28 = 1355364650807 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1355364691063) 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 in 7 ways as a sum of consecutive naturals, for example, 14228845 + ... + 14323782.

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

Almost surely, 21355364651063 is an apocalyptic number.

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

1355364651063 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 28568453.

The product of its (nonzero) digits is 2916000, while the sum is 48.

The spelling of 1355364651063 in words is "one trillion, three hundred fifty-five billion, three hundred sixty-four million, six hundred fifty-one thousand, sixty-three".

Divisors: 1 3 15823 47469 28552627 85657881 451788217021 1355364651063