12346
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18522
- Proper Divisor Sum (Aliquot Sum)
- 6176
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6172
- Möbius Function
- 1
- Radical
- 12346
- Omega Function (Ω)
- 2
- 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
- 112
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Number of simple graphs on n unlabeled nodes.at n=8A000088
- Restricted partitions.at n=15A001981
- Numbers k such that the continued fraction for sqrt(k) has period 91.at n=5A020430
- Subsets of natural numbers arranged in standard statistical (or Yates) order.at n=47A048794
- Table T(n,k) giving number of k-multigraphs on n nodes (n >= 1, k >= 0) read by antidiagonals.at n=43A063841
- Number of 8-colorable (i.e., chromatic number <= 8) simple graphs on n nodes.at n=7A076320
- Number of 9-colorable (i.e., chromatic number <= 9) simple graphs on n nodes.at n=7A076321
- Stirling-like number triangle defined by paired decomposition of C(n+3,3) = A000292.at n=32A080416
- Triangle read by rows in which the n-th row contains the n numbers in increasing order formed by the concatenation of first n-1 numbers. (The digits of the numbers with 2 or more digits are taken as one entity.) First row is taken to be 0.at n=16A081539
- a(0)=0; a(1)=2. Slowest increasing sequence where every digit "d" has a copy of itself in a(n+d).at n=18A102150
- Partial sums of A004676.at n=6A121807
- a(n) is the concatenation in increasing order of all single-digit divisors of n.at n=11A129476
- Binomial transform of [1, 5, 15, 35, 70, 0, 0, 0, ...].at n=9A143132
- 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), (0, 1, -1), (1, 0, -1), (1, 1, 0), (1, 1, 1)}.at n=7A150834
- a(n) = 2*(n^3 + n^2 + n - 1).at n=18A155120
- Integers k such that all the digits needed to write the consecutive nonnegative integers from 0 to k fill exactly a square (no holes, no overlaps).at n=40A158022
- Number of n-node simple graphs that are determined by their resistance distance multisets.at n=7A178944
- Number of strictly increasing arrangements of n numbers in -(n+3)..(n+3) with sum zero.at n=7A188177
- Number of strictly increasing arrangements of 8 numbers in -(n+6)..(n+6) with sum zero.at n=4A188186
- Subsets of positive integers arranged in canonical order.at n=32A213059