1105675002 has 64 divisors (see below), whose sum is σ = 2607033600. Its totient is φ = 346152960.

The previous prime is 1105674991. The next prime is 1105675007. The reversal of 1105675002 is 2005765011.

1105675002 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 587499 + ... + 589377.

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

Almost surely, 2^1105675002 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 2100, while the sum is 27.

The square root of 1105675002 is about 33251.6917163623. The cubic root of 1105675002 is about 1034.0522809647.

Subtracting 1105675002 from its reverse (2005765011), we obtain a palindrome (900090009).

The spelling of 1105675002 in words is "one billion, one hundred five million, six hundred seventy-five thousand, two".