10169140000000 has 576 divisors, whose sum is σ = 26677724673600. Its totient is φ = 3863552000000.

The previous prime is 10169139999877. The next prime is 10169140000009. The reversal of 10169140000000 is 4196101.

It can be written as a sum of positive squares in 32 ways, for example, as 1975531447296 + 8193608552704 = 1405536^2 + 2862448^2 .

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

It is a congruent number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 51619999902 + ... + 51620000098.

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

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

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 10169140000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13338862336800).

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

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

10169140000000 is an frugal number, since it uses more digits than its factorization.

10169140000000 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 216, while the sum is 22.

Adding to 10169140000000 its reverse (4196101), we get a palindrome (10169144196101).

The spelling of 10169140000000 in words is "ten trillion, one hundred sixty-nine billion, one hundred forty million", and thus it is an aban number.