Search a number
-
+
10521211106 = 272610117597
BaseRepresentation
bin10011100110001110…
…01111000011100010
31000011020111220100102
421303013033003202
5133021412223411
64500002022402
7521503550600
oct116307170342
930136456312
1010521211106
114509a4969a
122057647a02
13cb898b003
1471b47a870
15418a15d3b
hex2731cf0e2

10521211106 has 24 divisors (see below), whose sum is σ = 18362492316. Its totient is φ = 4508095200.

The previous prime is 10521211087. The next prime is 10521211133. The reversal of 10521211106 is 60111212501.

10521211106 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 2 ways, for example, as 9898459081 + 622752025 = 99491^2 + 24955^2 .

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

It is a Curzon number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 589100 + ... + 606696.

Almost surely, 210521211106 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 120, while the sum is 20.

Adding to 10521211106 its reverse (60111212501), we get a palindrome (70632423607).

The spelling of 10521211106 in words is "ten billion, five hundred twenty-one million, two hundred eleven thousand, one hundred six".

Divisors: 1 2 7 14 49 98 6101 12202 17597 35194 42707 85414 123179 246358 298949 597898 862253 1724506 107359297 214718594 751515079 1503030158 5260605553 10521211106