Search a number
-
+
11303150601 = 37177524971
BaseRepresentation
bin10101000011011100…
…00110010000001001
31002011201212112200110
422201232012100021
5141122101304401
65105333424533
7550050123561
oct124156062011
932151775613
1011303150601
114880374386
12223549b149
1310b19894c2
14793263da1
154624c19d6
hex2a1b86409

11303150601 has 8 divisors (see below), whose sum is σ = 15072996064. Its totient is φ = 7534369440.

The previous prime is 11303150569. The next prime is 11303150623. The reversal of 11303150601 is 10605130311.

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

It is not a de Polignac number, because 11303150601 - 25 = 11303150569 is a prime.

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

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 211303150601 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 532151.

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

Adding to 11303150601 its reverse (10605130311), we get a palindrome (21908280912).

The spelling of 11303150601 in words is "eleven billion, three hundred three million, one hundred fifty thousand, six hundred one".

Divisors: 1 3 7177 21531 524971 1574913 3767716867 11303150601