Search a number
-
+
10695143928000 = 2635371937137661
BaseRepresentation
bin1001101110100010100001…
…0000010011000011000000
31101212110000222011122002210
42123220220100103003000
52400212123321144000
634425140431542120
72152461431263440
oct233505020230300
941773028148083
1010695143928000
11345386aa1a974
12124895a08a940
135c771751aa7c
1428d90d51a120
15138312a24350
hex9ba284130c0

10695143928000 has 1792 divisors, whose sum is σ = 44017864151040. Its totient is φ = 2233516032000.

The previous prime is 10695143927977. The next prime is 10695143928013. The reversal of 10695143928000 is 82934159601.

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

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

It is an unprimeable number.

It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 16180247670 + ... + 16180248330.

Almost surely, 210695143928000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 466560, while the sum is 48.

The spelling of 10695143928000 in words is "ten trillion, six hundred ninety-five billion, one hundred forty-three million, nine hundred twenty-eight thousand".