Search a number
-
+
10670645040 = 243511137163181
BaseRepresentation
bin10011111000000010…
…10001111100110000
31000112122200221011120
421330001101330300
5133323141120130
64522500542240
7525266662206
oct117401217460
930478627146
1010670645040
114586334610
1220996b1980
13101091c363
14733259076
15426bd2910
hex27c051f30

10670645040 has 320 divisors, whose sum is σ = 36774646272. Its totient is φ = 2538086400.

The previous prime is 10670644997. The next prime is 10670645057. The reversal of 10670645040 is 4054607601.

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

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

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

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 58953750 + ... + 58953930.

Almost surely, 210670645040 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 20160, while the sum is 33.

The spelling of 10670645040 in words is "ten billion, six hundred seventy million, six hundred forty-five thousand, forty".