Search a number
-
+
10506620636 = 2217154509127
BaseRepresentation
bin10011100100011111…
…00100111011011100
31000010020001121222122
421302033210323130
5133004143330021
64454321202112
7521235542021
oct116217447334
930106047878
1010506620636
114501793656
122052790338
13cb594cbb5
1471955d548
154175d2bab
hex2723e4edc

10506620636 has 12 divisors (see below), whose sum is σ = 19468150128. Its totient is φ = 4944292032.

The previous prime is 10506620633. The next prime is 10506620651. The reversal of 10506620636 is 63602660501.

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

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 77254496 + ... + 77254631.

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

Almost surely, 210506620636 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 38880, while the sum is 35.

The spelling of 10506620636 in words is "ten billion, five hundred six million, six hundred twenty thousand, six hundred thirty-six".

Divisors: 1 2 4 17 34 68 154509127 309018254 618036508 2626655159 5253310318 10506620636