Base | Representation |
---|---|
bin | 10101100010001001… |
… | …11011010011001101 |
3 | 1002211200200011000101 |
4 | 22301010323103031 |
5 | 142134030341133 |
6 | 5151055531101 |
7 | 556326056500 |
oct | 126104732315 |
9 | 32750604011 |
10 | 11560793293 |
11 | 49a2848125 |
12 | 22a7829a91 |
13 | 11231767ba |
14 | 7b956d137 |
15 | 479e1537d |
hex | 2b113b4cd |
11560793293 has 12 divisors (see below), whose sum is σ = 13453550172. Its totient is φ = 9905360640.
The previous prime is 11560793281. The next prime is 11560793297. The reversal of 11560793293 is 39239706511.
11560793293 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 9965429929 + 1595363364 = 99827^2 + 39942^2 .
It is a de Polignac number, because none of the positive numbers 2k-11560793293 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 (11560793297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 83421 + ... + 173437.
It is an arithmetic number, because the mean of its divisors is an integer number (1121129181).
Almost surely, 211560793293 is an apocalyptic number.
It is an amenable number.
11560793293 is a deficient number, since it is larger than the sum of its proper divisors (1892756879).
11560793293 is an equidigital number, since it uses as much as digits as its factorization.
11560793293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92652 (or 92645 counting only the distinct ones).
The product of its (nonzero) digits is 306180, while the sum is 46.
The spelling of 11560793293 in words is "eleven billion, five hundred sixty million, seven hundred ninety-three thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •