10839
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14456
- Proper Divisor Sum (Aliquot Sum)
- 3617
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7224
- Möbius Function
- 1
- Radical
- 10839
- 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
- 42
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n with equal number of parts congruent to each of 0 and 2 (mod 4).at n=44A035541
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 1 (mod 4).at n=48A035546
- Layer counting sequence for hyperbolic tessellation by cuspidal triangles of angles (Pi/3, Pi/5, Pi/7).at n=15A054887
- Euler transform of Euler totient function phi(n), cf. A000010.at n=20A061255
- Numbers k such that k^4 contains a pandigital substring.at n=25A115934
- Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,k), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0) (0<=k<=n).at n=57A132276
- Floor(1/{(9+n^4)^(1/4)}), where {} = fractional part.at n=28A184633
- Numbers that match polynomials over {0,1} that have a factor containing 3 as a coefficient; see Comments.at n=31A208181
- Numbers that match polynomials over {0,1} that have a factor containing -3 as a coefficient; see Comments.at n=11A208182
- Triangle read by rows: T(n,k) is the number of ascent sequences of length n with maximal element k-1.at n=40A218577
- Least positive integer k such that prime(k*n) - 1 = (prime(i*n)-1)*(prime(j*n)-1) for some integers 0 < i < j < k.at n=47A257938
- Least positive integer k such that both k and k*n belong to the set {m>0: prime(prime(m))-prime(m)+1 = prime(p) for some prime p}.at n=11A260753
- 2^n+1 appears in A109732 at position a(n).at n=9A261414
- Integers m such that A006218(m) is triangular.at n=41A263457
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 774", based on the 5-celled von Neumann neighborhood.at n=38A273504
- Positions of 3's in A264977; positions of 6's in A277330.at n=30A277713
- Total number of edges in graph formed by the straight line segments connecting the edges of an equilateral triangle with the n-1 points resulting from a subdivision of the sides into n equal pieces.at n=42A332376
- a(n) is the number of edges formed by n-secting the angles of an equilateral triangle.at n=42A335412
- a(n) is the number of Chvátal-satisfying graphical n-sequences.at n=6A338512
- Numbers k >= 3 such that 1/d(k - 2) + 1/d(k - 1) + 1/d(k) is an integer, d(i) = A000005(i).at n=51A359056