Base | Representation |
---|---|
bin | 10101000100111001… |
… | …00101000010000101 |
3 | 1002012120210120221122 |
4 | 22202130211002011 |
5 | 141133211212201 |
6 | 5110450523325 |
7 | 550255522514 |
oct | 124234450205 |
9 | 32176716848 |
10 | 11315335301 |
11 | 4887236986 |
12 | 2239596545 |
13 | 10b436459a |
14 | 794b1667b |
15 | 4635cbe1b |
hex | 2a2725085 |
11315335301 has 8 divisors (see below), whose sum is σ = 11648774904. Its totient is φ = 10983349440.
The previous prime is 11315335181. The next prime is 11315335307. The reversal of 11315335301 is 10353351311.
It can be written as a sum of positive squares in 4 ways, for example, as 940894276 + 10374441025 = 30674^2 + 101855^2 .
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 11315335301 - 218 = 11315073157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11315335307) 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, 347630 + ... + 378783.
It is an arithmetic number, because the mean of its divisors is an integer number (1456096863).
Almost surely, 211315335301 is an apocalyptic number.
It is an amenable number.
11315335301 is a deficient number, since it is larger than the sum of its proper divisors (333439603).
11315335301 is an equidigital number, since it uses as much as digits as its factorization.
11315335301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 726871.
The product of its (nonzero) digits is 2025, while the sum is 26.
Adding to 11315335301 its reverse (10353351311), we get a palindrome (21668686612).
The spelling of 11315335301 in words is "eleven billion, three hundred fifteen million, three hundred thirty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •