Search a number
-
+
10571066240 = 2757532112
BaseRepresentation
bin10011101100001010…
…11010101110000000
31000021201022210201212
421312011122232000
5133122143104430
64504542345252
7522650403050
oct116605325600
930251283655
1010571066240
114535100589
12207028b228
13cc60c54a7
14723d37560
1541d0b2b95
hex27615ab80

10571066240 has 192 divisors, whose sum is σ = 29566723680. Its totient is φ = 3539128320.

The previous prime is 10571066189. The next prime is 10571066257. The reversal of 10571066240 is 4266017501.

It is a super-2 number, since 2×105710662402 (a number of 21 digits) contains 22 as substring.

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

It is a junction number, because it is equal to n+sod(n) for n = 10571066197 and 10571066206.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 50099735 + ... + 50099945.

Almost surely, 210571066240 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 10080, while the sum is 32.

The spelling of 10571066240 in words is "ten billion, five hundred seventy-one million, sixty-six thousand, two hundred forty".