Base | Representation |
---|---|
bin | 10000111010001111… |
… | …110100101010001001 |
3 | 1201212101210000121210 |
4 | 100322033310222021 |
5 | 244141204024221 |
6 | 12201413323333 |
7 | 1211643523443 |
oct | 207217645211 |
9 | 51771700553 |
10 | 18157095561 |
11 | 7778230700 |
12 | 3628936549 |
13 | 1934945037 |
14 | c43641493 |
15 | 71408a276 |
hex | 43a3f4a89 |
18157095561 has 24 divisors (see below), whose sum is σ = 26631545472. Its totient is φ = 10995556000.
The previous prime is 18157095503. The next prime is 18157095563. The reversal of 18157095561 is 16559075181.
It is not a de Polignac number, because 18157095561 - 229 = 17620224649 is a prime.
It is a super-2 number, since 2×181570955612 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 18157095561.
It is not an unprimeable number, because it can be changed into a prime (18157095563) 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 23 ways as a sum of consecutive naturals, for example, 453040 + ... + 491486.
It is an arithmetic number, because the mean of its divisors is an integer number (1109647728).
Almost surely, 218157095561 is an apocalyptic number.
18157095561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
18157095561 is a deficient number, since it is larger than the sum of its proper divisors (8474449911).
18157095561 is a wasteful number, since it uses less digits than its factorization.
18157095561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39773 (or 39762 counting only the distinct ones).
The product of its (nonzero) digits is 378000, while the sum is 48.
The spelling of 18157095561 in words is "eighteen billion, one hundred fifty-seven million, ninety-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •