Search a number
-
+
10003220112 = 243496741957
BaseRepresentation
bin10010101000011110…
…10000011010010000
3221211010211020021210
421110033100122100
5130441311020422
64332335420120
7502613653014
oct112417203220
927733736253
1010003220112
114273614366
121b32084640
13c35577072
146ac760544
153d82e710c
hex2543d0690

10003220112 has 40 divisors (see below), whose sum is σ = 25847470656. Its totient is φ = 3333655936.

The previous prime is 10003220107. The next prime is 10003220147. The reversal of 10003220112 is 21102230001.

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

It is an unprimeable number.

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 7 ways as a sum of consecutive naturals, for example, 217438 + ... + 259394.

Almost surely, 210003220112 is an apocalyptic number.

10003220112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.

It is an amenable number.

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

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

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

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

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

The product of its (nonzero) digits is 24, while the sum is 12.

Adding to 10003220112 its reverse (21102230001), we get a palindrome (31105450113).

The spelling of 10003220112 in words is "ten billion, three million, two hundred twenty thousand, one hundred twelve".

Divisors: 1 2 3 4 6 8 12 16 24 48 4967 9934 14901 19868 29802 39736 41957 59604 79472 83914 119208 125871 167828 238416 251742 335656 503484 671312 1006968 2013936 208400419 416800838 625201257 833601676 1250402514 1667203352 2500805028 3334406704 5001610056 10003220112