Base | Representation |
---|---|
bin | 10101011110100001… |
… | …11101100111010001 |
3 | 1002202120110201010001 |
4 | 22233100331213101 |
5 | 142103240102230 |
6 | 5144052210001 |
7 | 555506506141 |
oct | 125720754721 |
9 | 32676421101 |
10 | 11530394065 |
11 | 49876747a3 |
12 | 2299609901 |
13 | 1119a91ba8 |
14 | 7b54d8921 |
15 | 47740d0ca |
hex | 2af43d9d1 |
11530394065 has 8 divisors (see below), whose sum is σ = 14097538728. Its totient is φ = 9050271360.
The previous prime is 11530394047. The next prime is 11530394077. The reversal of 11530394065 is 56049303511.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 2150084161 + 9380309904 = 46369^2 + 96852^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11530394065 - 225 = 11496839633 is a prime.
It is a super-3 number, since 3×115303940653 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21755196 + ... + 21755725.
It is an arithmetic number, because the mean of its divisors is an integer number (1762192341).
Almost surely, 211530394065 is an apocalyptic number.
It is an amenable number.
11530394065 is a deficient number, since it is larger than the sum of its proper divisors (2567144663).
11530394065 is an equidigital number, since it uses as much as digits as its factorization.
11530394065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43510979.
The product of its (nonzero) digits is 48600, while the sum is 37.
Adding to 11530394065 its reverse (56049303511), we get a palindrome (67579697576).
The spelling of 11530394065 in words is "eleven billion, five hundred thirty million, three hundred ninety-four thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •