Base | Representation |
---|---|
bin | 111110011001… |
… | …001011110101 |
3 | 1010202222022221 |
4 | 332121023311 |
5 | 13141343320 |
6 | 1342322341 |
7 | 256011244 |
oct | 76311365 |
9 | 33688287 |
10 | 16356085 |
11 | 9261629 |
12 | 55893b1 |
13 | 3508975 |
14 | 225a95b |
15 | 16813aa |
hex | f992f5 |
16356085 has 4 divisors (see below), whose sum is σ = 19627308. Its totient is φ = 13084864.
The previous prime is 16356083. The next prime is 16356097. The reversal of 16356085 is 58065361.
16356085 is nontrivially palindromic in base 11.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 58065361 = 4297 ⋅13513.
It can be written as a sum of positive squares in 2 ways, for example, as 2643876 + 13712209 = 1626^2 + 3703^2 .
It is a cyclic number.
It is not a de Polignac number, because 16356085 - 21 = 16356083 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 16356085.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16356083) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1635604 + ... + 1635613.
It is an arithmetic number, because the mean of its divisors is an integer number (4906827).
Almost surely, 216356085 is an apocalyptic number.
It is an amenable number.
16356085 is a deficient number, since it is larger than the sum of its proper divisors (3271223).
16356085 is an equidigital number, since it uses as much as digits as its factorization.
16356085 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3271222.
The product of its (nonzero) digits is 21600, while the sum is 34.
The square root of 16356085 is about 4044.2656935469. The cubic root of 16356085 is about 253.8398405461.
The spelling of 16356085 in words is "sixteen million, three hundred fifty-six thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •