1365859690000 has 675 divisors, whose sum is σ = 3832050475539. Its totient is φ = 471219840000.

The previous prime is 1365859689989. The next prime is 1365859690021. The reversal of 1365859690000 is 969585631.

The square root of 1365859690000 is 1168700.

It is a perfect power (a square), and thus also a powerful number.

It can be written as a sum of positive squares in 22 ways, for example, as 865592058384 + 500267631616 = 930372^2 + 707296^2 .

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

It is a Harshad number since it is a multiple of its sum of digits (52).

It is a self number, because there is not a number n which added to its sum of digits gives 1365859690000.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 134 ways as a sum of consecutive naturals, for example, 44059989985 + ... + 44059990015.

Almost surely, 2^{1365859690000} is an apocalyptic number.

1365859690000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

1365859690000 is the 1168700-th square number.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 1365859690000

1365859690000 is an abundant number, since it is smaller than the sum of its proper divisors (2466190785539).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 174 (or 80 counting only the distinct ones).

The product of its (nonzero) digits is 1749600, while the sum is 52.

The spelling of 1365859690000 in words is "one trillion, three hundred sixty-five billion, eight hundred fifty-nine million, six hundred ninety thousand".