Search a number
-
+
2205311728992 = 2531931532393079
BaseRepresentation
bin100000000101110110110…
…100100111110101100000
321210211021222002022210220
4200011312310213311200
5242112434300311432
64405034535523040
7315220452256311
oct40056664476540
97724258068726
102205311728992
117802a3a84659
122b74a2529480
1312cc63188748
1478a481ba608
153c57293272c
hex20176d27d60

2205311728992 has 384 divisors, whose sum is σ = 6437781504000. Its totient is φ = 658252707840.

The previous prime is 2205311728979. The next prime is 2205311728993. The reversal of 2205311728992 is 2998271135022.

It is a congruent number.

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

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

Almost surely, 22205311728992 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1088640, while the sum is 51.

The spelling of 2205311728992 in words is "two trillion, two hundred five billion, three hundred eleven million, seven hundred twenty-eight thousand, nine hundred ninety-two".