Search a number
-
+
10201020112 = 24637563757
BaseRepresentation
bin10011000000000011…
…10011011011010000
3222022221000111212201
421200001303123100
5131342430120422
64404123132544
7510535145263
oct114001633320
928287014781
1010201020112
114365234438
121b88374154
13c67540b9a
146cab2ccda
153ea869727
hex2600736d0

10201020112 has 10 divisors (see below), whose sum is σ = 19764476498. Its totient is φ = 5100510048.

The previous prime is 10201020103. The next prime is 10201020113. The reversal of 10201020112 is 21102010201.

It can be written as a sum of positive squares in only one way, i.e., 8836752016 + 1364268096 = 94004^2 + 36936^2 .

It is a super-2 number, since 2×102010201122 (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 (10201020113) 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 as a sum of consecutive naturals, namely, 318781863 + ... + 318781894.

Almost surely, 210201020112 is an apocalyptic number.

It is an amenable number.

10201020112 is a deficient number, since it is larger than the sum of its proper divisors (9563456386).

10201020112 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 8, while the sum is 10.

Adding to 10201020112 its reverse (21102010201), we get a palindrome (31303030313).

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

Divisors: 1 2 4 8 16 637563757 1275127514 2550255028 5100510056 10201020112