Search a number
-
+
10683273216 = 212372111613
BaseRepresentation
bin10011111001100010…
…11101000000000000
31000120112110111202210
421330301131000000
5133334404220331
64524031342120
7525512216100
oct117461350000
930515414683
1010683273216
11459247a320
1220a1981940
131013421255
14734bc5200
15427d79446
hex27cc5d000

10683273216 has 312 divisors, whose sum is σ = 36170669664. Its totient is φ = 2773155840.

The previous prime is 10683273191. The next prime is 10683273217. The reversal of 10683273216 is 61237238601.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6622426 + ... + 6624038.

Almost surely, 210683273216 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 10683273216 in words is "ten billion, six hundred eighty-three million, two hundred seventy-three thousand, two hundred sixteen".