16296
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 47040
- Proper Divisor Sum (Aliquot Sum)
- 30744
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4608
- Möbius Function
- 0
- Radical
- 4074
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 53
- 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
- Areas of almost-equilateral Heronian triangles (integral side lengths m-1, m, m+1 and integral area).at n=4A011945
- Numbers whose base-5 representation has exactly 7 runs.at n=13A043607
- Triangle: a(n,m) = number of permutations of (1,2,...,n) with one or more fixed points in the m first positions.at n=31A061018
- a(n)=3a(n-1)+C(n+4,4),n>0, a(0)=1.at n=7A097787
- Greater of a,b where n^2 = a^3 + b^3; a,b>0 and gcd(a,b)=1. The lesser of a,b is the corresponding term in A099532 and n, which is used to order this sequence, is the corresponding term in A099426.at n=37A099533
- Numbers k such that k and k^2 use only the digits 1, 2, 5, 6 and 9.at n=24A137006
- Numerators of continued fraction convergents to sqrt(3)/2.at n=8A144535
- Numbers n such that n^2 can be represented as sum of (at least two) consecutive cubes and n is not a triangular number.at n=23A163393
- Numbers k with the property that k^2 is a product of two distinct triangular numbers.at n=34A175497
- Values of x satisfying x^2 = floor(y^2/3 + y).at n=12A232771
- Number of (n+1)X(2+1) 0..3 arrays with row and column sums nondecreasing, and no adjacent elements equal.at n=3A233029
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with row and column sums nondecreasing, and no adjacent elements equal.at n=11A233031
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with row and column sums nondecreasing, and no adjacent elements equal.at n=13A233031
- The stonemason's problem: numbers n such that n^2 is the sum of more than three consecutive cubes, the cube 1 being disallowed.at n=24A238099
- Triangle read by rows: T(m,n) = number of ways of distributing n distinguishable balls into m distinguishable bins of size 5 where empty bins are permitted (m >= 1, 1 <= n <= 5m).at n=36A248847
- Numbers c(n) whose square are equal to the sum of an odd number M of consecutive cubed integers b^3 + (b+1)^3 + ... + (b+M-1)^3 = c(n)^2, starting at b(n) (A253679).at n=2A253680
- Product of the sum of the divisors of n and the sum of the divisors of n-th prime.at n=43A272173
- Numbers n such that A003146(n) = floor(alpha^3*n)+1, where alpha = 1.839... is the positive real zero of x^3-x^2-x-1.at n=17A278353
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 355", based on the 5-celled von Neumann neighborhood.at n=13A281306
- Expansion of Sum_{k>=2} x^prime(k) / (1 - Sum_{k>=2} x^prime(k))^2.at n=35A281853