Search a number
-
+
2666325000 = 2335573487
BaseRepresentation
bin1001111011101100…
…1110010000001000
320212211011100021210
42132323032100020
520430034400000
61120324333120
7123034250163
oct23673162010
96784140253
102666325000
111149086489
12624b441a0
13336525b01
141b4188ada
15109132350
hex9eece408

2666325000 has 192 divisors, whose sum is σ = 8463208320. Its totient is φ = 699840000.

The previous prime is 2666324963. The next prime is 2666325001. The reversal of 2666325000 is 5236662.

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

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5474757 + ... + 5475243.

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

Almost surely, 22666325000 is an apocalyptic number.

2666325000 is a gapful number since it is divisible by the number (20) 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 2666325000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4231604160).

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

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

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

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

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

The product of its (nonzero) digits is 12960, while the sum is 30.

The square root of 2666325000 is about 51636.4696701856. The cubic root of 2666325000 is about 1386.6633215629.

The spelling of 2666325000 in words is "two billion, six hundred sixty-six million, three hundred twenty-five thousand".