Search a number
-
+
2540519235072 = 293272131945553
BaseRepresentation
bin100100111110000010101…
…111110001111000000000
322222212112011010222022200
4210332002233301320000
5313110440411010242
65223033132033200
7351355302124200
oct44760257617000
98885464128280
102540519235072
1189a478971315
12350452902800
131557541c2990
148ad67202400
1546140eb004c
hex24f82bf1e00

2540519235072 has 720 divisors, whose sum is σ = 9668929430160. Its totient is φ = 634748534784.

The previous prime is 2540519235029. The next prime is 2540519235101. The reversal of 2540519235072 is 2705329150452.

2540519235072 is a `hidden beast` number, since 2 + 5 + 4 + 0 + 51 + 92 + 3 + 507 + 2 = 666.

It is a congruent number.

It is an unprimeable number.

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 71 ways as a sum of consecutive naturals, for example, 55747848 + ... + 55793400.

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

Almost surely, 22540519235072 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 2540519235072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4834464715080).

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

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

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

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

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

The product of its (nonzero) digits is 756000, while the sum is 45.

The spelling of 2540519235072 in words is "two trillion, five hundred forty billion, five hundred nineteen million, two hundred thirty-five thousand, seventy-two".