Base | Representation |
---|---|
bin | 11110000111000001… |
… | …10000111100010111 |
3 | 1112201120101112012201 |
4 | 33003200300330113 |
5 | 231101223014322 |
6 | 11232013025331 |
7 | 1111404433036 |
oct | 170340607427 |
9 | 45646345181 |
10 | 16165048087 |
11 | 6945825981 |
12 | 3171785247 |
13 | 16a8023616 |
14 | ad4c5671d |
15 | 649248d27 |
hex | 3c3830f17 |
16165048087 has 4 divisors (see below), whose sum is σ = 16201870960. Its totient is φ = 16128225216.
The previous prime is 16165048069. The next prime is 16165048127. The reversal of 16165048087 is 78084056161.
16165048087 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 16165048087 - 27 = 16165047959 is a prime.
It is a super-2 number, since 2×161650480872 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16165048987) 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 3 ways as a sum of consecutive naturals, for example, 18410778 + ... + 18411655.
It is an arithmetic number, because the mean of its divisors is an integer number (4050467740).
Almost surely, 216165048087 is an apocalyptic number.
16165048087 is a deficient number, since it is larger than the sum of its proper divisors (36822873).
16165048087 is an equidigital number, since it uses as much as digits as its factorization.
16165048087 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36822872.
The product of its (nonzero) digits is 322560, while the sum is 46.
The spelling of 16165048087 in words is "sixteen billion, one hundred sixty-five million, forty-eight thousand, eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •