2529
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 3666
- Proper Divisor Sum (Aliquot Sum)
- 1137
- 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
- 1680
- Möbius Function
- 0
- Radical
- 843
- Omega Function (Ω)
- 3
- 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
- 71
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = round(n*phi^14), where phi is the golden ratio, A001622.at n=3A004949
- a(n) = ceiling(n*phi^14), where phi is the golden ratio, A001622.at n=3A004969
- Number of points on surface of tricapped prism: a(n) = 7*n^2 + 2 for n > 0, a(0)=1.at n=19A005919
- Coordination sequence T3 for Zeolite Code MTW.at n=33A008198
- Coordination sequence T3 for Zeolite Code NES.at n=32A008207
- tan(arcsin(x)-tan(x))=-1/3!*x^3-7/5!*x^5-47/7!*x^7+2529/9!*x^9...at n=3A013400
- Composite numbers that are equal to the sum of the first k composites for some k.at n=45A013921
- Pseudoprimes to base 53.at n=28A020181
- Pseudoprimes to base 89.at n=33A020217
- Numbers k such that the continued fraction for sqrt(k) has period 56.at n=5A020395
- Fibonacci sequence beginning 3, 9.at n=13A022379
- Numbers k such that Fibonacci(k) == 34 (mod k).at n=24A023180
- Triangle T(n,m) = Sum_{k=0..m} Catalan(n-k)*Catalan(k).at n=40A028364
- Triangle read by rows: T(n,m) = Sum Catalan(n-k)*Catalan(k), k=0..m.at n=50A028376
- Concatenate rows of triangle in A028364 (removing duplicates).at n=33A028378
- Number of equivalence classes of Boolean functions of n variables under action of M(n,2).at n=4A028405
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 28 ones.at n=11A031796
- Concatenation of n and n + 4 or {n,n+4}.at n=24A032609
- Numbers in which all pairs of consecutive base-8 digits differ by 3.at n=38A033079
- Number of partitions of n with equal number of parts congruent to each of 0 and 1 (mod 3).at n=39A035534