2360
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 5400
- Proper Divisor Sum (Aliquot Sum)
- 3040
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 928
- Möbius Function
- 0
- Radical
- 590
- Omega Function (Ω)
- 5
- 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
- 58
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- Hexagonal pyramidal numbers, or greengrocer's numbers.at n=15A002412
- Expansion of 1/((1-x)^4*(1+x)).at n=28A002623
- Worst cases for Pierce expansions (numerators).at n=29A006537
- Coordination sequence T3 for Zeolite Code AEL.at n=32A008006
- Coordination sequence T4 for Zeolite Code STI.at n=33A008237
- Triangle read by rows: T(n,k) (n>=1; 1<=k<=n) is the number of permutations of [n] in which the longest increasing run has length k.at n=51A008304
- Even hexagonal pyramidal numbers.at n=6A015226
- Expansion of 1/(1-x^5-x^6-x^7-x^8).at n=44A017839
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly seven 1's.at n=12A020443
- Convolution of integers >= 3 and Lucas numbers.at n=10A023553
- Base 6 expansion uses each positive digit just once.at n=17A023744
- a(n) = 1*(n) + 2*(n-1) + 3*(n-2) + ... + (n+1-k)*k, where k = floor((n+1)/2).at n=28A023855
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=19A025113
- a(n) = dot_product(1,2,...,n)*(4,5,...,n,1,2,3).at n=16A026040
- a(n) = n^2 + n + 8.at n=48A027693
- Theta series of 6-dimensional lattice of det 8.at n=18A029543
- Every run of digits of n in base 7 has length 2.at n=37A033005
- Four times pentagonal numbers: a(n) = 2*n*(3*n-1).at n=20A033579
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/9) starts with n.at n=37A034074
- a(n) = A001864(n+1)/2.at n=4A036276