Search a number
-
+
11031510213 = 321225723357
BaseRepresentation
bin10100100011000011…
…10111110011000101
31001110210201210010100
422101201313303011
5140043031311323
65022351314313
7540241201233
oct122141676305
931423653110
1011031510213
114750aaa999
12217a51b999
13106a60ab49
14769153953
15448715943
hex291877cc5

11031510213 has 6 divisors (see below), whose sum is σ = 15934403654. Its totient is φ = 7354340136.

The previous prime is 11031510179. The next prime is 11031510221. The reversal of 11031510213 is 31201513011.

11031510213 is a `hidden beast` number, since 110 + 31 + 510 + 2 + 13 = 666.

11031510213 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 only one way, i.e., 9130375809 + 1901134404 = 95553^2 + 43602^2 .

It is not a de Polignac number, because 11031510213 - 212 = 11031506117 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 211031510213 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 90, while the sum is 18.

The spelling of 11031510213 in words is "eleven billion, thirty-one million, five hundred ten thousand, two hundred thirteen".

Divisors: 1 3 9 1225723357 3677170071 11031510213