Base | Representation |
---|---|
bin | 111110110111… |
… | …100101101101 |
3 | 1011000022011101 |
4 | 332313211231 |
5 | 13204334441 |
6 | 1345123101 |
7 | 260040313 |
oct | 76674555 |
9 | 34008141 |
10 | 16480621 |
11 | 9337153 |
12 | 5629491 |
13 | 3550561 |
14 | 22900b3 |
15 | 16a8231 |
hex | fb796d |
16480621 has 2 divisors, whose sum is σ = 16480622. Its totient is φ = 16480620.
The previous prime is 16480609. The next prime is 16480631. The reversal of 16480621 is 12608461.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13875625 + 2604996 = 3725^2 + 1614^2 .
It is an emirp because it is prime and its reverse (12608461) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16480621 - 27 = 16480493 is a prime.
It is a super-2 number, since 2×164806212 = 543221737091282, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 16480621.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16480601) 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, 8240310 + 8240311.
It is an arithmetic number, because the mean of its divisors is an integer number (8240311).
Almost surely, 216480621 is an apocalyptic number.
It is an amenable number.
16480621 is a deficient number, since it is larger than the sum of its proper divisors (1).
16480621 is an equidigital number, since it uses as much as digits as its factorization.
16480621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 28.
The square root of 16480621 is about 4059.6331115016. The cubic root of 16480621 is about 254.4824618049.
The spelling of 16480621 in words is "sixteen million, four hundred eighty thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •