Base | Representation |
---|---|
bin | 1111010010001110000100… |
… | …1100011110110111011000 |
3 | 2012111121102110001001020201 |
4 | 3310203201030132313120 |
5 | 4200321023143121304 |
6 | 55424232201231544 |
7 | 3353112445543366 |
oct | 364434114366730 |
9 | 65447373031221 |
10 | 16805690207704 |
11 | 539a286aa9462 |
12 | 1a7507b7925b4 |
13 | 94ba012b4798 |
14 | 421584c90636 |
15 | 1e224ba103a4 |
hex | f48e131edd8 |
16805690207704 has 32 divisors (see below), whose sum is σ = 31765142200320. Its totient is φ = 8335012111776.
The previous prime is 16805690207701. The next prime is 16805690207707. The reversal of 16805690207704 is 40770209650861.
It is an interprime number because it is at equal distance from previous prime (16805690207701) and next prime (16805690207707).
It is a super-2 number, since 2×168056902077042 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16805690207701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3429937 + ... + 6736159.
It is an arithmetic number, because the mean of its divisors is an integer number (992660693760).
Almost surely, 216805690207704 is an apocalyptic number.
It is an amenable number.
16805690207704 is a deficient number, since it is larger than the sum of its proper divisors (14959451992616).
16805690207704 is a wasteful number, since it uses less digits than its factorization.
16805690207704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3311359 (or 3311355 counting only the distinct ones).
The product of its (nonzero) digits is 5080320, while the sum is 55.
The spelling of 16805690207704 in words is "sixteen trillion, eight hundred five billion, six hundred ninety million, two hundred seven thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •