Search a number
-
+
10953957000 = 2335372322679
BaseRepresentation
bin10100011001110100…
…00001111010001000
31001021101210200010010
422030322001322020
5134413203111000
65010541151520
7535310045460
oct121472017210
931241720103
1010953957000
114711250028
12215855b5a0
13105752637c
1475cb26ba0
154419e6d50
hex28ce81e88

10953957000 has 256 divisors, whose sum is σ = 40758681600. Its totient is φ = 2394796800.

The previous prime is 10953956999. The next prime is 10953957017. The reversal of 10953957000 is 75935901.

It is a self number, because there is not a number n which added to its sum of digits gives 10953957000.

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, 471661 + ... + 494339.

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

Almost surely, 210953957000 is an apocalyptic number.

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

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

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

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

10953957000 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 42525, while the sum is 39.

The spelling of 10953957000 in words is "ten billion, nine hundred fifty-three million, nine hundred fifty-seven thousand".