Base | Representation |
---|---|
bin | 111110110111… |
… | …011110001101 |
3 | 1011000021111121 |
4 | 332313132031 |
5 | 13204331031 |
6 | 1345120541 |
7 | 260036026 |
oct | 76673615 |
9 | 34007447 |
10 | 16480141 |
11 | 9336857 |
12 | 5629151 |
13 | 3550282 |
14 | 228dc4d |
15 | 16a8011 |
hex | fb778d |
16480141 has 4 divisors (see below), whose sum is σ = 16600572. Its totient is φ = 16359712.
The previous prime is 16480109. The next prime is 16480151. The reversal of 16480141 is 14108461.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14108461 = 229 ⋅61609.
It can be written as a sum of positive squares in 2 ways, for example, as 11417641 + 5062500 = 3379^2 + 2250^2 .
It is a cyclic number.
It is not a de Polignac number, because 16480141 - 25 = 16480109 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 (16480151) 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 in 3 ways as a sum of consecutive naturals, for example, 60010 + ... + 60283.
It is an arithmetic number, because the mean of its divisors is an integer number (4150143).
Almost surely, 216480141 is an apocalyptic number.
16480141 is the 2568-th centered pentagonal number.
It is an amenable number.
16480141 is a deficient number, since it is larger than the sum of its proper divisors (120431).
16480141 is a wasteful number, since it uses less digits than its factorization.
16480141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120430.
The product of its (nonzero) digits is 768, while the sum is 25.
The square root of 16480141 is about 4059.5739924283. The cubic root of 16480141 is about 254.4799911705.
The spelling of 16480141 in words is "sixteen million, four hundred eighty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •