2526
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5064
- Proper Divisor Sum (Aliquot Sum)
- 2538
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 840
- Möbius Function
- -1
- Radical
- 2526
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 177
- 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
- a(n) is the number of compositions of n in which the maximal part is 3.at n=14A000100
- Boustrophedon transform (second version) of Fibonacci numbers 1,1,2,3,...at n=7A000744
- a(n) = n concatenated with n + 1.at n=24A001704
- Coordination sequence T1 for Zeolite Code AEI.at n=38A008001
- Coordination sequence T5 for Zeolite Code HEU.at n=33A008120
- Coordination sequence for Cr3Si, Cr position.at n=13A009928
- a(n) = Sum_{i=0..n-1} a(i)*a(n-i) with a(0)=1, a(1)=6.at n=6A014435
- Numbers k such that Fibonacci(k) == 8 (mod k).at n=23A023177
- Convolution of composite numbers and odd numbers.at n=14A023650
- Pair up the numbers.at n=12A030655
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 32.at n=21A031530
- Numbers with exactly five distinct base-7 digits.at n=2A031984
- a(n) = C(n+2,3) + 2*C(n,2) + 2*(n-2).at n=21A034857
- Concatenation of two or more consecutive positive integers.at n=33A035333
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+1 or 24k-1. Also number of partitions in which no odd part is repeated, with no part of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=49A036029
- Number of partitions of n such that cn(3,5) <= cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5).at n=59A036865
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 2.at n=46A038633
- Numerators of continued fraction convergents to sqrt(707).at n=7A042360
- Numbers n such that string 1,6 occurs in the base 9 representation of n but not of n-1.at n=35A044266
- Numbers n such that string 2,6 occurs in the base 10 representation of n but not of n-1.at n=28A044358