Search a number
-
+
10222753632 = 2537135322079
BaseRepresentation
bin10011000010101001…
…01101011101100000
3222101102220200122220
421201110231131200
5131414011104012
64410221031040
7511220654310
oct114124553540
928342820586
1010222753632
114376529123
121b936b5480
13c6bbb0360
146cd989440
153ec70e08c
hex26152d760

10222753632 has 192 divisors, whose sum is σ = 33652039680. Its totient is φ = 2645121024.

The previous prime is 10222753631. The next prime is 10222753637. The reversal of 10222753632 is 23635722201.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10222753631) by changing a digit.

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

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

Almost surely, 210222753632 is an apocalyptic number.

10222753632 is a gapful number since it is divisible by the number (12) 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 10222753632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16826019840).

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

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

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

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

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

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

The spelling of 10222753632 in words is "ten billion, two hundred twenty-two million, seven hundred fifty-three thousand, six hundred thirty-two".