5356
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 10192
- Proper Divisor Sum (Aliquot Sum)
- 4836
- 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
- 2448
- Möbius Function
- 0
- Radical
- 2678
- Omega Function (Ω)
- 4
- 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
- yes
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- yes
- 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
- 28
- 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
- Number of degree-n even permutations of order dividing 2.at n=10A000704
- Binomial coefficient C(8n,n-11).at n=2A004392
- Sum of degrees of irreducible representations of alternating group A_n.at n=9A007002
- Number of inequivalent ways (mod D_4) a pair of checkers can be placed on an n X n board.at n=16A014409
- a(n) = 2*n*(4*n - 1).at n=26A014635
- Numbers n such that phi(n) * sigma(n) + 9 is a perfect square.at n=43A015728
- Numbers k such that k | 12^k + 12.at n=20A015904
- Pseudoprimes to base 9.at n=38A020138
- Pseudoprimes to base 29.at n=33A020157
- Pseudoprimes to base 61.at n=41A020189
- 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+3)/m < s for some integer k.at n=27A024844
- a(n) = Sum_{k=0..n} (k+1) * A026769(n, k).at n=9A027243
- a(n) = (prime(n)-3)*(prime(n)-5)/8.at n=45A030007
- Triangular numbers that have some nontrivial permutation of digits which is also triangular.at n=25A034291
- Triangular numbers (A000217) with prime indices.at n=26A034953
- Even triangular numbers with prime indices.at n=13A034955
- Number of partitions of n into parts not of the form 23k, 23k+8 or 23k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=30A035996
- Numbers having four 4's in base 6.at n=4A043388
- Starting index of a string of exactly 3 consecutive equal digits in decimal expansion of Pi.at n=37A049519
- a(n) = (117*n^2 - 99*n + 2)/2.at n=10A050408