Base | Representation |
---|---|
bin | 10101000001001001… |
… | …11101110100011011 |
3 | 1002010101210112221102 |
4 | 22200210331310123 |
5 | 141102144321142 |
6 | 5103410502015 |
7 | 546425146361 |
oct | 124044756433 |
9 | 32111715842 |
10 | 11283979547 |
11 | 487056a935 |
12 | 222ab9490b |
13 | 10aaa06499 |
14 | 7908b3631 |
15 | 460986532 |
hex | 2a093dd1b |
11283979547 has 16 divisors (see below), whose sum is σ = 11997469440. Its totient is φ = 10594362912.
The previous prime is 11283979541. The next prime is 11283979549. The reversal of 11283979547 is 74597938211.
11283979547 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11283979547 is a prime.
It is a super-2 number, since 2×112839795472 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11283979492 and 11283979501.
It is not an unprimeable number, because it can be changed into a prime (11283979541) 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 15 ways as a sum of consecutive naturals, for example, 263138 + ... + 303000.
It is an arithmetic number, because the mean of its divisors is an integer number (749841840).
Almost surely, 211283979547 is an apocalyptic number.
11283979547 is a deficient number, since it is larger than the sum of its proper divisors (713489893).
11283979547 is a wasteful number, since it uses less digits than its factorization.
11283979547 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40162.
The product of its digits is 3810240, while the sum is 56.
The spelling of 11283979547 in words is "eleven billion, two hundred eighty-three million, nine hundred seventy-nine thousand, five hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •