Base | Representation |
---|---|
bin | 111101010001… |
… | …010010110000 |
3 | 1010020000101200 |
4 | 331101102300 |
5 | 13102432431 |
6 | 1332131200 |
7 | 253343604 |
oct | 75212260 |
9 | 33200350 |
10 | 16061616 |
11 | 908036a |
12 | 5466b00 |
13 | 343491c |
14 | 21c1504 |
15 | 1623ee6 |
hex | f514b0 |
16061616 has 30 divisors (see below), whose sum is σ = 44950620. Its totient is φ = 5353824.
The previous prime is 16061603. The next prime is 16061623. The reversal of 16061616 is 61616061.
It is a self number, because there is not a number n which added to its sum of digits gives 16061616.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 55626 + ... + 55913.
It is an arithmetic number, because the mean of its divisors is an integer number (1498354).
Almost surely, 216061616 is an apocalyptic number.
16061616 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
16061616 is an abundant number, since it is smaller than the sum of its proper divisors (28889004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16061616 is a wasteful number, since it uses less digits than its factorization.
16061616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111553 (or 111544 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 16061616 is about 4007.6945991430. The cubic root of 16061616 is about 252.3072593763.
Adding to 16061616 its reverse (61616061), we get a palindrome (77677677).
It can be divided in two parts, 160 and 61616, that added together give a triangular number (61776 = T351).
The spelling of 16061616 in words is "sixteen million, sixty-one thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •