Base | Representation |
---|---|
bin | 111101010001… |
… | …001000010101 |
3 | 1010012222110222 |
4 | 331101020111 |
5 | 13102422244 |
6 | 1332124125 |
7 | 253341632 |
oct | 75211025 |
9 | 33188428 |
10 | 16060949 |
11 | 907a913 |
12 | 5466645 |
13 | 3434528 |
14 | 21c1189 |
15 | 1623bee |
hex | f51215 |
16060949 has 4 divisors (see below), whose sum is σ = 16281036. Its totient is φ = 15840864.
The previous prime is 16060939. The next prime is 16060951. The reversal of 16060949 is 94906061.
16060949 is nontrivially palindromic in base 12.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 94906061 = 97 ⋅978413.
It can be written as a sum of positive squares in 2 ways, for example, as 9394225 + 6666724 = 3065^2 + 2582^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16060949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16060939) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 109934 + ... + 110079.
It is an arithmetic number, because the mean of its divisors is an integer number (4070259).
Almost surely, 216060949 is an apocalyptic number.
It is an amenable number.
16060949 is a deficient number, since it is larger than the sum of its proper divisors (220087).
16060949 is an equidigital number, since it uses as much as digits as its factorization.
16060949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220086.
The product of its (nonzero) digits is 11664, while the sum is 35.
The square root of 16060949 is about 4007.6113833554. The cubic root of 16060949 is about 252.3037667582.
The spelling of 16060949 in words is "sixteen million, sixty thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •