10914
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 23328
- Proper Divisor Sum (Aliquot Sum)
- 12414
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3392
- Möbius Function
- 1
- Radical
- 10914
- 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
- 68
- 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
- Sum over all n! permutations of n elements of minimum lengths of cycles.at n=6A028417
- [ exp(17/22)*n! ].at n=6A030831
- Numbers that can be expressed as the product of two 3-digit numbers in at least one way.at n=27A033829
- a(n) = prime(n)*prime(n+1) - prime(n+1).at n=26A037167
- a(n) = (5*n+2)*(5*n+7).at n=20A085036
- Maximum possible number of subtrees of an n-node unrooted tree in which each node has maximum degree three (equivalently, rooted binary trees in which some internal nodes may have only one child). A subtree is a nonempty contiguous set of nodes, not necessarily including all descendants of the root.at n=20A124454
- Number of imprimitive transitive permutation groups of degree n.at n=44A132221
- a(n) = (n+6)*(n+1)*(n^2 + 7*n + 16)/4.at n=12A168538
- Antidiagonal sums of the convolution array A213587.at n=10A213589
- Triangle read by rows: absolute values of odd-numbered rows of A225433.at n=10A225398
- Triangle read by rows: absolute values of odd-numbered rows of A225433.at n=14A225398
- Number of nX4 0..3 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, and upper left element zero.at n=3A230992
- T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 4 and at least one element with value (x(i,j)-1) mod 4, and upper left element zero.at n=24A230994
- a(n) = 3*(9*n - 1)*(3*n - 2).at n=12A277985
- Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 491", based on the 5-celled von Neumann neighborhood.at n=15A282655
- Self-composition of the number of divisors function (A000005).at n=9A307305
- Number T(n,k) of entries in the k-th cycles of all permutations of [n] when cycles are ordered by increasing lengths (and increasing smallest elements); triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=21A322383
- Number of Frobenius partitions of 2*n that satisfy the condition that the sum of the entries on the top row plus the number of columns is less than or equal to the sum of the entries on the bottom row.at n=18A342208
- Sum of products of cubes of parts , counted without multiplicity, in all partitions of n.at n=8A369888