Search a number
-
+
11315000061 = 321966169591
BaseRepresentation
bin10101000100110110…
…10011001011111101
31002012120011120002100
422202123103023331
5141133120000221
65110435415313
7550252625241
oct124233231375
932176146070
1011315000061
114887028022
122239454539
1310b4277b11
14794a6a421
15463562926
hex2a26d32fd

11315000061 has 12 divisors (see below), whose sum is σ = 17204093920. Its totient is φ = 7146315720.

The previous prime is 11315000057. The next prime is 11315000087. The reversal of 11315000061 is 16000051311.

It is not a de Polignac number, because 11315000061 - 22 = 11315000057 is a prime.

It is a Duffinian number.

It is a Curzon number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11315000041) 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 11 ways as a sum of consecutive naturals, for example, 33084625 + ... + 33084966.

Almost surely, 211315000061 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 11315000061 its reverse (16000051311), we get a palindrome (27315051372).

The spelling of 11315000061 in words is "eleven billion, three hundred fifteen million, sixty-one", and thus it is an aban number.

Divisors: 1 3 9 19 57 171 66169591 198508773 595526319 1257222229 3771666687 11315000061