5476
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 9
- Divisor Sum
- 9849
- Proper Divisor Sum (Aliquot Sum)
- 4373
- 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
- 2664
- Möbius Function
- 0
- Radical
- 74
- Omega Function (Ω)
- 4
- 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
- yes
- 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
- 41
- 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
- yes
- Achilles Number
- no
- Perfect Power
- yes
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Coordination sequence T12 for Zeolite Code MFI.at n=47A008164
- Even squares: a(n) = (2*n)^2.at n=37A016742
- a(n) = (3n+2)^2.at n=25A016790
- a(n) = (4n + 2)^2.at n=18A016826
- a(n) = (5*n + 4)^2.at n=14A016898
- a(n) = (6*n + 2)^2.at n=12A016934
- a(n) = (7*n + 4)^2.at n=10A017030
- a(n) = (8*n + 2)^2.at n=9A017090
- a(n) = (9*n + 2)^2.at n=8A017186
- a(n) = (10*n + 4)^2.at n=7A017318
- a(n) = (11*n + 8)^2.at n=6A017486
- a(n) = (12*n + 2)^2.at n=6A017546
- Numbers k that are the sum of m nonzero squares for all 1 <= m <= k - 14.at n=25A018820
- a(n) = position of 3*(n^2) in A000408.at n=46A024800
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=40A024834
- a(n) = floor(Sum_{1<=i<j<=n} (sqrt(j)-sqrt(i))^2).at n=45A025196
- Squares k^2 in which the digits of k appear.at n=14A029773
- Squares in which parity of digits alternates.at n=19A030152
- Squares such that in n and sqrt(n) the parity of digits alternates.at n=14A030154
- Even squares in which parity of digits alternates.at n=7A030158