Base | Representation |
---|---|
bin | 111101010001… |
… | …010001101110 |
3 | 1010020000022020 |
4 | 331101101232 |
5 | 13102432200 |
6 | 1332131010 |
7 | 253343451 |
oct | 75212156 |
9 | 33200266 |
10 | 16061550 |
11 | 908030a |
12 | 5466a66 |
13 | 343489b |
14 | 21c1498 |
15 | 1623ea0 |
hex | f5146e |
16061550 has 24 divisors (see below), whose sum is σ = 39833016. Its totient is φ = 4283040.
The previous prime is 16061543. The next prime is 16061557. The reversal of 16061550 is 5516061.
It is an interprime number because it is at equal distance from previous prime (16061543) and next prime (16061557).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 16061550.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16061557) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 53389 + ... + 53688.
It is an arithmetic number, because the mean of its divisors is an integer number (1659709).
Almost surely, 216061550 is an apocalyptic number.
16061550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16061550 is an abundant number, since it is smaller than the sum of its proper divisors (23771466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16061550 is a wasteful number, since it uses less digits than its factorization.
16061550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107092 (or 107087 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 24.
The square root of 16061550 is about 4007.6863649742. The cubic root of 16061550 is about 252.3069137842.
The spelling of 16061550 in words is "sixteen million, sixty-one thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •