10416
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 40
- Divisor Sum
- 31744
- Proper Divisor Sum (Aliquot Sum)
- 21328
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2880
- Möbius Function
- 0
- Radical
- 1302
- Omega Function (Ω)
- 7
- 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
- 104
- 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
- Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n*(n+1)*(2*n+1)/6.at n=31A000330
- Number of convex polygons of perimeter 2n on square lattice.at n=7A005436
- Number of minimal plane trees with n terminal nodes.at n=35A006241
- Smallest k such that sigma(x) = k has exactly n solutions.at n=22A007368
- Weight distribution of extended Hamming code of length 64.at n=2A010082
- a(n) = floor(n*(n-1)*(n-2)/24).at n=64A011842
- Even square pyramidal numbers.at n=14A015222
- Expansion of g.f. 1/((1-2*x)*(1-4*x)*(1-8*x)).at n=4A016290
- Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (4,k)-perfect numbers.at n=41A019293
- Numbers whose base-6 representation is the juxtaposition of two identical strings.at n=47A020334
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (odd natural numbers).at n=30A024598
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 17.at n=5A031695
- Numbers k such that 43*2^k+1 is prime.at n=19A032371
- Numbers in which all pairs of consecutive base-5 digits differ by 2.at n=42A033083
- Base 6 digits are, in order, the first n terms of the periodic sequence with initial period 1,2,0.at n=5A037507
- Base 5 digits are, in order, the first n terms of the periodic sequence with initial period 3,1.at n=5A037584
- Numbers whose base-5 representation contains exactly three 1's and three 3's.at n=14A045247
- Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of k.at n=19A056132
- Consider the line segment in R^n from the origin to the point P=(1,2,3,...,n); let d = squared distance to this line from the closest point of Z^n (excluding the endpoints). Sequence gives d times P.P.at n=30A059774
- Antidiagonal sums of A086272 (and of A086273).at n=20A086274