12382
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
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19152
- Proper Divisor Sum (Aliquot Sum)
- 6770
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6000
- Möbius Function
- -1
- Radical
- 12382
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 169
- 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
- Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n^3 + 3*n^2 + 8*n)/6 (n > 0).at n=41A003600
- Values of Newton-Gregory forward interpolating polynomial (1/3)*(2*n-7)*(2*n^2-11*n+18).at n=24A030434
- Values of Newton-Gregory forward interpolating polynomial (1/3)*(2*n - 3)*(2*n^2 - 3*n + 4).at n=22A030441
- Number of n-node rooted identity trees of height at most 7.at n=16A038086
- Denominators of continued fraction convergents to sqrt(431).at n=9A041821
- a(n) = Sum_{k=1..n} phi(k)^2.at n=42A057434
- Numbers k such that sopf(k) = 2*sopf(k+1), where sopf(k) = A008472.at n=19A064112
- Pseudo-random numbers: MS C 6.0 version.at n=25A084275
- One fifth of the sum of the first n primes, when an integer.at n=24A112271
- Number of partitions of n having no doubletons. By a doubleton in a partition we mean an occurrence of a part exactly twice (the partition [4,(3,3),2,2,2,(1,1)] of 18 has two doubletons, shown between parentheses).at n=39A116645
- Triangle read by rows: T(n,k) is the number of connected directed multigraphs with loops and no vertex of degree 0, with n arcs and k vertices.at n=32A139621
- G.f.: A(x) = exp( Sum_{n>=1} sigma(n^3)*x^n/n ), a power series in x with integer coefficients.at n=9A156304
- Number of partitions of n into consecutive initial Fibonacci numbers.at n=49A172491
- Number of partitions of n containing at least one part m-9 if m is the largest part.at n=32A212549
- Number of simple unlabeled graphs on n nodes with exactly 4 connected components that are trees or cycles.at n=13A215984
- a(n) = n*(15*n-11)/2.at n=41A226489
- Number of paths in B(n) that start with a u step and end with a d step.at n=15A247471
- Numbers n such that n*9^n + 1 is prime.at n=1A265013
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 30", based on the 5-celled von Neumann neighborhood.at n=33A269755
- Sum of squares of parts of the partitions of 2n into two squarefree parts.at n=19A280316