2597
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 3078
- Proper Divisor Sum (Aliquot Sum)
- 481
- 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
- 2184
- Möbius Function
- 0
- Radical
- 371
- 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
- 146
- 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) = (6*n+1)*(6*n+5).at n=8A001513
- a(n) = (4*n+1)*(4*n+5).at n=12A003185
- G.f.: 1/((1-x)*(1-x^2)*(1-x^3)^2*(1-x^4)*(1-x^5)).at n=32A003402
- An upper bound on the biplanar crossing number of the complete graph on n nodes.at n=30A007333
- Number of strict 7th-order maximal independent sets in cycle graph.at n=52A007394
- a(n) = dot_product(1,2,...,n)*(5,6,...,n,1,2,3,4).at n=16A026043
- a(n) = n^2 - 4.at n=49A028347
- Positions of records in A030717.at n=50A030722
- Coordination sequence T4 for Zeolite Code SBE.at n=41A033607
- The sequence e when b=[ 1,0,1,1,1,... ].at n=29A042953
- Numbers having three 0's in base 6.at n=29A043371
- Numbers whose base-7 representation contains exactly three 0's.at n=21A043395
- Numbers k such that string 0,5 occurs in the base 9 representation of k but not of k-1.at n=34A044256
- Numbers n such that string 9,7 occurs in the base 10 representation of n but not of n-1.at n=27A044429
- Numbers n such that string 0,5 occurs in the base 9 representation of n but not of n+1.at n=34A044637
- Numbers n such that string 9,7 occurs in the base 10 representation of n but not of n+1.at n=27A044810
- Concatenate n with n-th prime.at n=24A045532
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A048149.at n=16A049712
- a(n) = n*p where p is the next prime >= n.at n=48A053024
- Numbers k such that k | 6^k + 5^k + 4^k + 3^k + 2^k + 1^k.at n=30A056745