Search a number
-
+
10691472000 = 273531120249
BaseRepresentation
bin10011111010100001…
…01110101010000000
31000121002220001101110
421331100232222000
5133344004101000
64524523203320
7525642004206
oct117520565200
930532801343
1010691472000
11459706a180
1220a4676540
131015031cc1
14735d1b076
15428948850
hex27d42ea80

10691472000 has 256 divisors, whose sum is σ = 38666160000. Its totient is φ = 2591744000.

The previous prime is 10691471977. The next prime is 10691472037. The reversal of 10691472000 is 27419601.

It is a happy number.

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

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

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 517876 + ... + 538124.

Almost surely, 210691472000 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 10691472000 in words is "ten billion, six hundred ninety-one million, four hundred seventy-two thousand".