2369
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2496
- Proper Divisor Sum (Aliquot Sum)
- 127
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2244
- Möbius Function
- 1
- Radical
- 2369
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 120
- 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
- Non-Hamiltonian simplicial polyhedra with n nodes.at n=14A007030
- Coordination sequence T1 for Zeolite Code LEV.at n=36A008127
- Expansion of (1+x)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=51A008762
- Coordination sequence T1 for Zeolite Code iRON.at n=34A009881
- a(n) = floor(n*(n-1)*(n-2)*(n-3)/31).at n=18A011941
- Coordination sequence T1 for Zeolite Code TER.at n=33A016433
- a(n) is the concatenation of n and 3n.at n=22A019551
- Numbers k such that the continued fraction for sqrt(k) has period 36.at n=26A020375
- a(n) = n*(9*n - 1)/2.at n=23A022266
- Fibonacci sequence beginning 1, 26.at n=11A022396
- a(n) = T(n,n-2), where T is the array in A026386.at n=45A026393
- Coordination sequence T1 for Zeolite Code SAT.at n=35A027373
- Numbers k such that in k and k^2 the parity of digits alternates.at n=23A030153
- "CGK" (necklace, element, unlabeled) transform of 1,3,5,7,...at n=10A032159
- Numbers whose set of base-9 digits is {2,3}.at n=22A032809
- Numbers whose set of base-5 digits is {3,4}.at n=35A032829
- Coordination sequence T4 for Zeolite Code SBT.at n=39A033615
- If n is composite, replace n with the concatenation of its nontrivial divisors, otherwise a(n) = n.at n=17A037279
- If n is composite replace n with the concatenation of its nontrivial divisors [ A037279 ] then divide out any factors of 2.at n=17A037280
- Numbers whose base-4 and base-5 expansions have no digits in common.at n=41A037352