5232
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 13640
- Proper Divisor Sum (Aliquot Sum)
- 8408
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1728
- Möbius Function
- 0
- Radical
- 654
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 147
- 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
- yes
- Odd
- no
Appears in sequences
- Coefficients for step-by-step integration.at n=2A002400
- Expansion of a modular function for Gamma_0(6).at n=13A002507
- Number of partitions of 2n with all subsums different from n.at n=20A006827
- Coordination sequence T6 for Zeolite Code MFS.at n=45A008178
- Theta series of direct sum of 2 copies of D_4 lattice in powers of q^2.at n=4A008658
- Arrange the nontrivial binomial coefficients C(m,k) (2 <= k <= m-2) in increasing order; record the positions of the central binomial coefficients.at n=11A022913
- a(n) = T(2n-1,n), array T given by A048225.at n=38A048234
- a(n)=T(n,n+3), array T as in A049723.at n=39A049731
- Triangle of partial row sums of triangle A037027(n,m), n >= m >= 0 (Fibonacci convolution triangle).at n=57A054446
- McKay-Thompson series of class 23A for Monster.at n=22A058570
- Positive numbers whose product of digits is 5 times their sum.at n=37A062382
- Total number of walks with length > 0 in the Hasse diagram of a Boolean algebra of order n.at n=6A066534
- Multiples of 4 using only prime digits (2, 3, 5 and 7).at n=39A077534
- Multiples of 6 with only prime digits (2, 3, 5 and 7).at n=18A077535
- Local maxima of A053707 (first differences of A025475, powers of a prime but not prime).at n=43A088365
- Least multiple k of prime(n) such that (k-1,k+1) forms a twin prime pair, or 0 if no such number exists.at n=28A090530
- Main diagonal of square array A096589.at n=15A096590
- Matrix inverse of A103247, so that T(n,k) = C(n,k)*A010842(n-k), read by rows.at n=22A107056
- Numbers n such that (n + prime(n)), (n+1 + prime(n+1)) and (n+2 + prime(n+2)) are divisible by 5.at n=31A107581
- Number of 3 X 3 magic squares (with distinct positive entries) having all entries < n.at n=36A108576