Base | Representation |
---|---|
bin | 11111000001100010… |
… | …11011101010100001 |
3 | 1120222210010021011000 |
4 | 33200301123222201 |
5 | 233102411103031 |
6 | 11352430542213 |
7 | 1126515203232 |
oct | 174061335241 |
9 | 46883107130 |
10 | 16655956641 |
11 | 7077942825 |
12 | 328a067969 |
13 | 175594455c |
14 | b40123089 |
15 | 6773b83e6 |
hex | 3e0c5baa1 |
16655956641 has 32 divisors (see below), whose sum is σ = 24791961600. Its totient is φ = 11051698320.
The previous prime is 16655956633. The next prime is 16655956661. The reversal of 16655956641 is 14665955661.
16655956641 is a `hidden beast` number, since 1 + 6 + 6 + 5 + 595 + 6 + 6 + 41 = 666.
16655956641 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 16655956641 - 23 = 16655956633 is a prime.
It is a super-4 number, since 4×166559566414 (a number of 42 digits) contains 4444 as substring.
It is not an unprimeable number, because it can be changed into a prime (16655956631) 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 31 ways as a sum of consecutive naturals, for example, 5665750 + ... + 5668688.
It is an arithmetic number, because the mean of its divisors is an integer number (774748800).
Almost surely, 216655956641 is an apocalyptic number.
It is an amenable number.
16655956641 is a deficient number, since it is larger than the sum of its proper divisors (8136004959).
16655956641 is a wasteful number, since it uses less digits than its factorization.
16655956641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3866 (or 3860 counting only the distinct ones).
The product of its digits is 5832000, while the sum is 54.
The spelling of 16655956641 in words is "sixteen billion, six hundred fifty-five million, nine hundred fifty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •