10616
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19920
- Proper Divisor Sum (Aliquot Sum)
- 9304
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5304
- Möbius Function
- 0
- Radical
- 2654
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 55
- 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
- Numerators of continued fraction convergents to sqrt(449).at n=7A041854
- a(n) is the number of n-tosses having a run of 3 or more heads for a fair coin (i.e., probability is a(n)/2^n).at n=13A050231
- Expansion of x/(1 - 2*x^2 - 21*x^3).at n=11A122509
- Number of base 14 n-digit numbers with adjacent digits differing by five or less.at n=4A126535
- Triangle of numbers obtained from the partition array A134284.at n=48A134285
- 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, 0), (0, 0, -1), (0, 1, 1), (1, 0, -1)}.at n=9A148695
- 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, 1, 0), (0, 0, -1), (0, 1, 1), (1, 0, -1)}.at n=9A148696
- 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, 0), (-1, 1, -1), (0, 0, 1), (1, 0, 0), (1, 0, 1)}.at n=7A151050
- Indices k such that 13 plus the k-th triangular number is a perfect square.at n=9A154144
- Number of ways to place 3 nonattacking zebras on a 3 X n board.at n=13A172221
- G.f.: x^4*(1+x)*(1+12*x-31*x^2+12*x^2)/((1-x)^2*(1-2*x)^2*(1-3*x)*(1-4*x)).at n=8A187695
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2+x^2+y^2>=n.at n=22A211641
- Number of permutations of [n] with at least two (possibly overlapping) occurrences of the consecutive step pattern {up}^2.at n=8A230620
- Number of nX4 0..3 arrays with no element equal to one plus the sum of elements to its left or one plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=10A240791
- Number of standard Young tableaux with 2n cells and largest value in row n.at n=6A246731
- Expansion of Product_{k=1..24} theta_3(q^k), where theta_3() is the Jacobi theta function.at n=29A320248
- Expansion of Product_{1 <= i_1 <= i_2 <= i_3 <= i_4} (1 + x^(i_1*i_2*i_3*i_4)).at n=37A321567
- Sum_{n>=0} a(n) * x^n / (n!)^2 = exp(x) * BesselI(0,2*sqrt(exp(x) - 1)).at n=5A336588
- Triangular array read by rows: T(m,n) = number of Yamanouchi words of length m that start with n, m >= 1, n = 1..m.at n=71A369588
- Triangular array read by rows: T(m,n) = number of Yamanouchi words over the alphabet {1, 2, ..., n} of length m that start with n, m >= 1, n = 1..m.at n=71A369589