Base | Representation |
---|---|
bin | 10101000011110100… |
… | …00010111011011001 |
3 | 1002011221202200010121 |
4 | 22201322002323121 |
5 | 141123402021323 |
6 | 5105524513241 |
7 | 550115550235 |
oct | 124172027331 |
9 | 32157680117 |
10 | 11306282713 |
11 | 4882113600 |
12 | 223654b821 |
13 | 10b251501b |
14 | 79383b5c5 |
15 | 4628dea5d |
hex | 2a1e82ed9 |
11306282713 has 12 divisors (see below), whose sum is σ = 12730683924. Its totient is φ = 10027740800.
The previous prime is 11306282711. The next prime is 11306282759. The reversal of 11306282713 is 31728260311.
11306282713 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 3702965904 + 7603316809 = 60852^2 + 87197^2 .
It is not a de Polignac number, because 11306282713 - 21 = 11306282711 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11306282711) 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, 1134556 + ... + 1144477.
It is an arithmetic number, because the mean of its divisors is an integer number (1060890327).
Almost surely, 211306282713 is an apocalyptic number.
It is an amenable number.
11306282713 is a deficient number, since it is larger than the sum of its proper divisors (1424401211).
11306282713 is a wasteful number, since it uses less digits than its factorization.
11306282713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2279096 (or 2279085 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 34.
The spelling of 11306282713 in words is "eleven billion, three hundred six million, two hundred eighty-two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •