Base | Representation |
---|---|
bin | 1110100110111110001010… |
… | …1011111011110101111111 |
3 | 2002212120121012022211222101 |
4 | 3221233202223323311333 |
5 | 4101132340041402441 |
6 | 54055032424125531 |
7 | 3245330221202200 |
oct | 351574253736577 |
9 | 62776535284871 |
10 | 16062685887871 |
11 | 5133168480877 |
12 | 19750810068a7 |
13 | 8c692152a75c |
14 | 3d761c3ad5a7 |
15 | 1ccc62327231 |
hex | e9be2afbd7f |
16062685887871 has 12 divisors (see below), whose sum is σ = 18713519070840. Its totient is φ = 13747124161680.
The previous prime is 16062685887851. The next prime is 16062685887883. The reversal of 16062685887871 is 17878858626061.
It is a de Polignac number, because none of the positive numbers 2k-16062685887871 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16062685887794 and 16062685887803.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16062685887821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 248685400 + ... + 248749981.
It is an arithmetic number, because the mean of its divisors is an integer number (1559459922570).
Almost surely, 216062685887871 is an apocalyptic number.
16062685887871 is a deficient number, since it is larger than the sum of its proper divisors (2650833182969).
16062685887871 is an equidigital number, since it uses as much as digits as its factorization.
16062685887871 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 497436054 (or 497436047 counting only the distinct ones).
The product of its (nonzero) digits is 433520640, while the sum is 73.
The spelling of 16062685887871 in words is "sixteen trillion, sixty-two billion, six hundred eighty-five million, eight hundred eighty-seven thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •