Base | Representation |
---|---|
bin | 111101001111… |
… | …011011101101 |
3 | 1010012121221111 |
4 | 331033123231 |
5 | 13102211442 |
6 | 1332032021 |
7 | 253312441 |
oct | 75173355 |
9 | 33177844 |
10 | 16053997 |
11 | 9075673 |
12 | 5462611 |
13 | 343130b |
14 | 21bc821 |
15 | 1621b17 |
hex | f4f6ed |
16053997 has 2 divisors, whose sum is σ = 16053998. Its totient is φ = 16053996.
The previous prime is 16053979. The next prime is 16054009. The reversal of 16053997 is 79935061.
Together with previous prime (16053979) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15768841 + 285156 = 3971^2 + 534^2 .
It is a cyclic number.
It is not a de Polignac number, because 16053997 - 211 = 16051949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16053497) 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 as a sum of consecutive naturals, namely, 8026998 + 8026999.
It is an arithmetic number, because the mean of its divisors is an integer number (8026999).
Almost surely, 216053997 is an apocalyptic number.
It is an amenable number.
16053997 is a deficient number, since it is larger than the sum of its proper divisors (1).
16053997 is an equidigital number, since it uses as much as digits as its factorization.
16053997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51030, while the sum is 40.
The square root of 16053997 is about 4006.7439399093. The cubic root of 16053997 is about 252.2673581806.
The spelling of 16053997 in words is "sixteen million, fifty-three thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.039 sec. • engine limits •