2522
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
- 8
- Divisor Sum
- 4116
- Proper Divisor Sum (Aliquot Sum)
- 1594
- 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
- 1152
- Möbius Function
- -1
- Radical
- 2522
- 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
- 40
- 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
- Coordination sequence T1 for Zeolite Code FAU.at n=42A008105
- Coordination sequence T2 for Zeolite Code AHT.at n=34A009867
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t(n)=2*n+1 (odd numbers).at n=23A023865
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = natural numbers, t = odd natural numbers.at n=22A024862
- Coordination sequence T3 for Zeolite Code IFR.at n=35A024984
- a(n) = T(2n-1,n), where T is the array in A026098.at n=24A026102
- a(n) = Sum_{k=0..n} (k+1) * A026769(n, n-k).at n=8A027244
- Coordination sequence T2 for Zeolite Code CGS.at n=37A027366
- Sequence satisfies T(T(a))=a, where T is defined below.at n=51A027581
- None of the digits in k is present in k^2 or k^3.at n=19A029790
- Multiplicity of highest weight (or singular) vectors associated with character chi_28 of Monster module.at n=33A034416
- Number of 4-ary rooted trees with n nodes and height exactly 9.at n=14A036633
- Numbers having three 2's in base 10.at n=24A043499
- Numbers n such that string 1,2 occurs in the base 9 representation of n but not of n-1.at n=35A044262
- Numbers n such that string 2,2 occurs in the base 10 representation of n but not of n-1.at n=25A044354
- Numbers k such that string 1,2 occurs in the base 9 representation of k but not of k+1.at n=35A044643
- Numbers n such that string 2,2 occurs in the base 10 representation of n but not of n+1.at n=25A044735
- Numbers whose base-5 representation contains exactly two 0's and two 4's.at n=25A045212
- Numbers m such that the factorizations of m..m+3 have the same number of primes (including multiplicities).at n=5A045940
- Numbers m such that the factorizations of m..m+4 have the same number of primes (including multiplicities).at n=1A045941