5523
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
- 8448
- Proper Divisor Sum (Aliquot Sum)
- 2925
- 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
- 3144
- Möbius Function
- -1
- Radical
- 5523
- 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
- 129
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n of the form a_1*b_1^2 + a_2*b_2^2 + ...; number of semisimple rings with p^n elements for any prime p.at n=26A004101
- Numbers k giving rise to prime quadruples (30k+11, 30k+13, 30k+17, 30k+19).at n=45A014561
- a(n) = n*(25*n + 1)/2.at n=21A022283
- Number of partitions of n with equal nonzero number of parts congruent to each of 2 and 3 (mod 5).at n=41A035569
- T(n,n-3), array T as in A038792.at n=32A038793
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 2 (mod 4).at n=56A046766
- a(n) = (3*n*F(2n-1) + (3-n)*F(2n))/5 where F() = Fibonacci numbers A000045.at n=9A059502
- The array in A059502 read by antidiagonals in 'up' direction.at n=44A059503
- Sum of squares of first n quarter-squares (A002620).at n=13A059859
- Number of irreducible representations of the symmetric group S_n such that their degree is divisible by 3.at n=29A061569
- Positive numbers whose product of digits is 10 times their sum.at n=28A062043
- Engel expansion of Gamma(1/4)=3.62560990822190831193...at n=7A068479
- a(1) = 4; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=36A074341
- Minimal m such that n^n-m and n^n+m are both primes, or -1 if there is no such m.at n=36A075468
- Multiples of 7 using only prime digits (2, 3, 5 and 7).at n=34A077536
- Number of irreducible polynomials (over the rationals) of form a*x^2+b*x+c, 1 <= a,b,c <= n.at n=17A079671
- a(n) = 5*n^2/2 - 5*n + 13/4 - (-1)^n/4.at n=47A121509
- Times in hours, minutes and seconds (to the nearest second) at which the hour and minute hands of an analog clock, if interchanged, continue to indicate some other albeit accurate times, over a complete 12-hour sweep for the slower hand. Leading zeros omitted.at n=11A121577
- Q(n,6), where Q(m,k) is defined in A127080 and A127137.at n=27A127148
- Number of different values of i^2+j^2+k^2+l^2+m^2+n^2 for i,j,k,l,m,n in [0,n].at n=32A132438