Search a number
-
+
15621701040 = 243351131127167
BaseRepresentation
bin11101000110010000…
…00011110110110000
31111022200222122012000
432203020003312300
5223443123413130
611102043134000
71062056160621
oct164310036660
944280878160
1015621701040
116697052230
12303b814300
13161c5a23aa
14a82a19a48
156166bc260
hex3a3203db0

15621701040 has 640 divisors, whose sum is σ = 61436067840. Its totient is φ = 3614284800.

The previous prime is 15621701021. The next prime is 15621701077. The reversal of 15621701040 is 4010712651.

It is a happy number.

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

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

It is an unprimeable number.

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 93543037 + ... + 93543203.

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

Almost surely, 215621701040 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 15621701040 in words is "fifteen billion, six hundred twenty-one million, seven hundred one thousand, forty".