2513
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2880
- Proper Divisor Sum (Aliquot Sum)
- 367
- 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
- 2148
- Möbius Function
- 1
- Radical
- 2513
- 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
- 133
- 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
- Padovan sequence (or Padovan numbers): a(n) = a(n-2) + a(n-3) with a(0) = 1, a(1) = a(2) = 0.at n=34A000931
- Total number of fixed points in planted trees with n nodes.at n=14A005202
- For n = 0, 1, 2, a(n) = n; thereafter, a(n) = 2*a(n-1) - a(n-2) + a(n-3).at n=15A005314
- Number of graphs with n nodes, n-1 edges and no isolated vertices.at n=10A006648
- Coordination sequence T4 for Zeolite Code AFO.at n=33A008018
- Coordination sequence T3 for Zeolite Code AFR.at n=38A008021
- Coordination sequence T1 for Zeolite Code AST.at n=36A008036
- Coordination sequence T3 for Zeolite Code DAC.at n=32A008069
- Coordination sequence T2 for Zeolite Code NES.at n=32A008206
- a(0) = 1, a(n) = 31*n^2 + 2 for n>0.at n=9A010020
- Pisot sequences E(3,7), P(3,7).at n=8A010912
- Number of CdI_2 polytypes that repeat after 2n layers.at n=8A011958
- Take every 5th term of Padovan sequence A000931, beginning with the fifth term.at n=6A012493
- Numbers k such that the continued fraction for sqrt(k) has period 30.at n=39A020369
- Pisot sequences E(5,9), P(5,9).at n=11A020713
- Pisot sequences E(7,9), P(7,9).at n=21A020720
- Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-11).at n=18A023441
- Convolution of composite numbers and (F(2), F(3), F(4), ...).at n=10A023649
- Golc sequence in base 7. Left to right concatenation of n,int(log_7(n)),int(log_7(int(log_7(n)))),... in base7.at n=50A028437
- Coordination sequence T2 for Zeolite Code CFI.at n=33A033600