Base | Representation |
---|---|
bin | 10101000000100111… |
… | …11100101010111001 |
3 | 1002010002101220101111 |
4 | 22200103330222321 |
5 | 141100024042033 |
6 | 5103131120321 |
7 | 546342216163 |
oct | 124023745271 |
9 | 32102356344 |
10 | 11279518393 |
11 | 4868aa3130 |
12 | 22295a30a1 |
13 | 10a9b03a50 |
14 | 790071933 |
15 | 4603a47cd |
hex | 2a04fcab9 |
11279518393 has 16 divisors (see below), whose sum is σ = 13262590656. Its totient is φ = 9457381440.
The previous prime is 11279518381. The next prime is 11279518417. The reversal of 11279518393 is 39381597211.
11279518393 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11279518393 - 29 = 11279517881 is a prime.
It is a super-3 number, since 3×112795183933 (a number of 31 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11279518373) 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, 140946 + ... + 205972.
It is an arithmetic number, because the mean of its divisors is an integer number (828911916).
Almost surely, 211279518393 is an apocalyptic number.
11279518393 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11279518393 is a deficient number, since it is larger than the sum of its proper divisors (1983072263).
11279518393 is a wasteful number, since it uses less digits than its factorization.
11279518393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66264.
The product of its digits is 408240, while the sum is 49.
The spelling of 11279518393 in words is "eleven billion, two hundred seventy-nine million, five hundred eighteen thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •