16482
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 34272
- Proper Divisor Sum (Aliquot Sum)
- 17790
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5280
- Möbius Function
- 1
- Radical
- 16482
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 66
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of positive integers <= 2^n of the form 3*x^2 + 4*y^2.at n=17A000049
- Numbers that are the sum of 4 positive 6th powers.at n=41A003360
- Numerators of continued fraction convergents to sqrt(350).at n=6A041662
- Numbers n such that p(6n) is prime, where p(n) is the number of partitions of n.at n=35A111036
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 1, -1), (0, 1, 1), (1, 1, 1)}.at n=7A150990
- Twice 12-gonal numbers: a(n) = 2*n*(5*n-4).at n=41A152965
- Number of (n+1) X 5 0..1 arrays with column and row pair sums b(i,j)=a(i,j)+a(i,j-1) and c(i,j)=a(i,j)+a(i-1,j) nondecreasing in column and row directions, respectively.at n=13A204647
- Number of partitions of n such that (number of distinct parts) = m(1) - m(2), where m = multiplicity.at n=54A240055
- Expansion of Product_{k>=1} ((1 + x^k) / (1 - x^(5*k)))^k.at n=19A285459
- Value of the n-th Roman number interpreted as Latin alphabetic number.at n=18A285511
- Number of separable partitions of n that consist of an odd number of parts.at n=40A325724
- Numbers k such that there are exactly 9 numbers j for which binomial(k, floor(k/2)) / binomial(k,j) is an integer, i.e., A080383(k) = 9.at n=6A327431
- Number of unlabeled vertically indecomposable modular lattices on n nodes.at n=17A342132
- Expansion of 1/((1 - x^4 - x^5)^2 - 4*x^9).at n=37A376725
- G.f. satisfies A(x) = A(x^2)*A(x^3) / (1-x).at n=40A382126