Base | Representation |
---|---|
bin | 111110000001… |
… | …111101110101 |
3 | 1010121010212120 |
4 | 332001331311 |
5 | 13130322411 |
6 | 1340310153 |
7 | 255134052 |
oct | 76017565 |
9 | 33533776 |
10 | 16260981 |
11 | 91a7130 |
12 | 5542359 |
13 | 34a45a9 |
14 | 2234029 |
15 | 1663106 |
hex | f81f75 |
16260981 has 8 divisors (see below), whose sum is σ = 23652384. Its totient is φ = 9855120.
The previous prime is 16260973. The next prime is 16260991. The reversal of 16260981 is 18906261.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16260981 - 23 = 16260973 is a prime.
It is a super-2 number, since 2×162609812 = 528839006164722, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 492757 = 16260981 / (1 + 6 + 2 + 6 + 0 + 9 + 8 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16260991) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 246346 + ... + 246411.
It is an arithmetic number, because the mean of its divisors is an integer number (2956548).
Almost surely, 216260981 is an apocalyptic number.
16260981 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16260981 is a deficient number, since it is larger than the sum of its proper divisors (7391403).
16260981 is a wasteful number, since it uses less digits than its factorization.
16260981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 492771.
The product of its (nonzero) digits is 5184, while the sum is 33.
The square root of 16260981 is about 4032.4906695490. The cubic root of 16260981 is about 253.3468919721.
The spelling of 16260981 in words is "sixteen million, two hundred sixty thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •