2630
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
- 8
- Divisor Sum
- 4752
- Proper Divisor Sum (Aliquot Sum)
- 2122
- 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
- 1048
- Möbius Function
- -1
- Radical
- 2630
- 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
- 53
- 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
- Number of alternating sign n X n matrices that are symmetric about a diagonal.at n=6A005163
- Number of tree-rooted toroidal maps with 2 faces and n vertices and without separating loops.at n=2A006439
- Inverse Moebius transform of Fibonacci numbers 1,1,2,3,5,8,...at n=17A007435
- Coordination sequence T2 for Zeolite Code MOR.at n=33A008183
- Numbers k such that Fibonacci(k) == -55 (mod k).at n=43A023170
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (1, p(1), p(2), ...).at n=17A024460
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (primes).at n=16A024468
- Duplicate of A024468.at n=16A025080
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 5, with initial values 1,1,1,1.at n=10A025268
- a(n) = T(n,n+2), T given by A027052.at n=11A027053
- Concatenation of n and n + 4 or {n,n+4}.at n=25A032609
- Number of partitions satisfying cn(2,5) + cn(3,5) < cn(1,5) + cn(4,5).at n=28A039893
- Numerators of continued fraction convergents to sqrt(358).at n=6A041678
- Base-6 palindromes that start with 2.at n=15A043011
- Numbers n such that string 4,2 occurs in the base 9 representation of n but not of n-1.at n=36A044289
- Numbers n such that string 3,0 occurs in the base 10 representation of n but not of n-1.at n=29A044362
- Numbers n such that string 6,3 occurs in the base 10 representation of n but not of n-1.at n=28A044395
- Numbers n such that string 4,2 occurs in the base 9 representation of n but not of n+1.at n=36A044670
- Numbers n such that string 3,0 occurs in the base 10 representation of n but not of n+1.at n=29A044743
- a(n) = Sum_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604.at n=18A047881