Base | Representation |
---|---|
bin | 10101000001001111… |
… | …10110110001011001 |
3 | 1002010110020001010102 |
4 | 22200213312301121 |
5 | 141102343041423 |
6 | 5103435025145 |
7 | 546434453126 |
oct | 124047666131 |
9 | 32113201112 |
10 | 11284737113 |
11 | 4870a38021 |
12 | 222b29b1b5 |
13 | 10aac10250 |
14 | 790a2d74d |
15 | 460a85c28 |
hex | 2a09f6c59 |
11284737113 has 8 divisors (see below), whose sum is σ = 12158243328. Its totient is φ = 10412009424.
The previous prime is 11284737091. The next prime is 11284737119. The reversal of 11284737113 is 31173748211.
11284737113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11284737113 - 28 = 11284736857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11284737119) 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 7 ways as a sum of consecutive naturals, for example, 164345 + ... + 222662.
It is an arithmetic number, because the mean of its divisors is an integer number (1519780416).
Almost surely, 211284737113 is an apocalyptic number.
11284737113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11284737113 is a deficient number, since it is larger than the sum of its proper divisors (873506215).
11284737113 is a wasteful number, since it uses less digits than its factorization.
11284737113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389263.
The product of its digits is 28224, while the sum is 38.
The spelling of 11284737113 in words is "eleven billion, two hundred eighty-four million, seven hundred thirty-seven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •