Search a number
-
+
11505145351 = 73153019103
BaseRepresentation
bin10101011011100001…
…01001011000000111
31002200210221221101111
422231300221120013
5142030304122401
65141351105451
7555052056550
oct125560513007
932623857344
1011505145351
114974399a97
122291072287
13111479171b
147b2005327
154750c1e51
hex2adc29607

11505145351 has 8 divisors (see below), whose sum is σ = 13572890624. Its totient is φ = 9543438360.

The previous prime is 11505145343. The next prime is 11505145357. The reversal of 11505145351 is 15354150511.

It is a happy number.

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 11505145351 - 23 = 11505145343 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (31).

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 211505145351 is an apocalyptic number.

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

11505145351 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 53019141.

The product of its (nonzero) digits is 7500, while the sum is 31.

Adding to 11505145351 its reverse (15354150511), we get a palindrome (26859295862).

The spelling of 11505145351 in words is "eleven billion, five hundred five million, one hundred forty-five thousand, three hundred fifty-one".

Divisors: 1 7 31 217 53019103 371133721 1643592193 11505145351