5661
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 8892
- Proper Divisor Sum (Aliquot Sum)
- 3231
- 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
- 3456
- Möbius Function
- 0
- Radical
- 1887
- 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
- 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
- 36
- 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
- no
- Odd
- yes
Appears in sequences
- Triangulations of the disk G_{n,0}.at n=7A002709
- Positions of remoteness 6 in Beans-Don't-Talk.at n=44A005694
- Coefficient of x^4 in expansion of (1+x+x^2)^n.at n=16A005712
- Coordination sequence T7 for Zeolite Code DDR.at n=47A008077
- Weight distribution of [ 17,9,7 ] code over GF(4).at n=16A014488
- Distinct odd elements in 3-Pascal triangle A028262 (by row).at n=43A028268
- Odd elements (greater than 1) to right of central elements in 3-Pascal triangle A028262.at n=41A028274
- Weight distribution of [ 17,8,8 ] code over GF(4).at n=8A030061
- Size of lexicographic code of length n, Hamming distance 8 and weight 8.at n=37A030069
- Lucky numbers that are decimal concatenations of n with n + 5.at n=5A032655
- Numbers n such that 291*2^n-1 is prime.at n=22A050904
- Number of noncaterpillar trees on n nodes (A000055-A005418).at n=14A052471
- Number of obtuse triangles made from vertices of a regular n-gon.at n=37A060423
- Sum of n-th row of triangle of primes: 2; 2 3 2; 2 3 5 3 2; 2 3 5 7 5 3 2; ...; where n-th row contains 2n+1 terms.at n=38A061802
- Positive numbers whose product of digits is 10 times their sum.at n=31A062043
- Orchard crossing number of complete bipartite graph K_{1,n}.at n=36A080838
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n and height k (1 <= k <= n).at n=48A080936
- a(1) = 4 and then least composite such that every partial concatenation of 2 or more terms is a prime.at n=41A086474
- Output of the linear congruential pseudo-random number generator used in function rand() as described in Kernighan and Ritchie, when seeded with 0.at n=29A096554
- Least k such that decimal representation of k*n contains only digits 0 and 3.at n=52A096682