Search a number
-
+
11030131523 = 1011021106963
BaseRepresentation
bin10100100010111001…
…00111001101000011
31001110201010201220202
422101130213031003
5140042203202043
65022301555415
7540223366565
oct122134471503
931421121822
1011030131523
114750249084
122179b75b6b
13106a247458
14768cb5335
154485421b8
hex291727343

11030131523 has 8 divisors (see below), whose sum is σ = 11150355216. Its totient is φ = 10910124000.

The previous prime is 11030131513. The next prime is 11030131529. The reversal of 11030131523 is 32513103011.

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 11030131523 - 24 = 11030131507 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (11030131529) 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, 49640 + ... + 156602.

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

Almost surely, 211030131523 is an apocalyptic number.

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

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

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

The sum of its prime factors is 108085.

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

Adding to 11030131523 its reverse (32513103011), we get a palindrome (43543234534).

The spelling of 11030131523 in words is "eleven billion, thirty million, one hundred thirty-one thousand, five hundred twenty-three".

Divisors: 1 101 1021 103121 106963 10803263 109209223 11030131523