16828
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 33712
- Proper Divisor Sum (Aliquot Sum)
- 16884
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 7200
- Möbius Function
- 0
- Radical
- 8414
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 110
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- a(n) = Sum_{k=0..n} ceiling(k^3/n).at n=39A014813
- Number of connected 4-regular simple graphs on n vertices with girth at least 4.at n=16A033886
- Numbers whose base-7 representation contains exactly four 0's.at n=14A043396
- Triangle read by rows: row n is the first row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (3,4,4,...) and super- and subdiagonals (1,1,1,...).at n=40A124574
- Positive numbers of the form x^4 - 6 * x^2 * y^2 + y^4 (where x,y are integers).at n=35A135789
- 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, -1, 1), (-1, 0, 1), (-1, 1, 0), (1, -1, -1), (1, 0, 0)}.at n=10A148518
- Irregular triangle C(n,g) counting the connected 4-regular simple graphs on n vertices with girth exactly g.at n=20A184940
- Irregular triangle C(n,g) counting the connected 4-regular simple graphs on n vertices with girth at least g.at n=20A184941
- Number of connected 4-regular simple graphs on n vertices with girth exactly 4.at n=16A184944
- Triangular array C(n, k) = number of connected k-regular graphs, having girth at least 4, with n nodes, 0 <= k <= n div 2.at n=75A186714
- Triangular array C(n,k) counting connected k-regular simple graphs on n vertices with girth exactly 4.at n=75A186734
- Number of (w,x,y,z) with all terms in {1,...,n} and w >= |x-y| + |y-z|.at n=14A212675
- a(n) = A122536(n) - A216958(n).at n=31A216960
- Number of necklaces with n beads of unlabeled colors such that the numbers of beads per color are distinct.at n=12A261531
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 185", based on the 5-celled von Neumann neighborhood.at n=27A270636