Search a number
-
+
10952634000 = 24353711151157
BaseRepresentation
bin10100011001101001…
…11110111010010000
31001021022022110022010
422030310332322100
5134412333242000
65010452542520
7535262565360
oct121464767220
931238273263
1010952634000
114710527040
122158021a40
131057182129
1475c8a09a0
15441834d50
hex28cd3ee90

10952634000 has 640 divisors, whose sum is σ = 44598288384. Its totient is φ = 2246400000.

The previous prime is 10952633977. The next prime is 10952634067. The reversal of 10952634000 is 43625901.

10952634000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

Almost surely, 210952634000 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 10952634000 in words is "ten billion, nine hundred fifty-two million, six hundred thirty-four thousand".