Search a number
-
+
11215015131 = 322716468451
BaseRepresentation
bin10100111000111011…
…11000110011011011
31001221121000210112210
422130131320303123
5140432020441011
65052504410203
7544630025055
oct123435706333
931847023483
1011215015131
114835646951
12220ba76963
13109963b138
147856808d5
154598b26a6
hex29c778cdb

11215015131 has 8 divisors (see below), whose sum is σ = 15019228224. Its totient is φ = 7443739400.

The previous prime is 11215015067. The next prime is 11215015139. The reversal of 11215015131 is 13151051211.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 11215015131 - 26 = 11215015067 is a prime.

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

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8233545 + ... + 8234906.

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

Almost surely, 211215015131 is an apocalyptic number.

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

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

11215015131 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 16468681.

The product of its (nonzero) digits is 150, while the sum is 21.

Adding to 11215015131 its reverse (13151051211), we get a palindrome (24366066342).

The spelling of 11215015131 in words is "eleven billion, two hundred fifteen million, fifteen thousand, one hundred thirty-one".

Divisors: 1 3 227 681 16468451 49405353 3738338377 11215015131