5751
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
- 4
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 8712
- Proper Divisor Sum (Aliquot Sum)
- 2961
- 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
- 3780
- Möbius Function
- 0
- Radical
- 213
- Omega Function (Ω)
- 5
- 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
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 54
- 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
- Reverse digits of number of partitions of n.at n=24A004089
- Number of connected trivalent graphs with 2n nodes and girth exactly 5.at n=10A006925
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049747.at n=32A049750
- a(0) = 1, a(1) = 3; for n >= 2 a(n) is the number of degree-n monic reducible polynomials over GF(3), i.e., a(n) = 3^n - A027376(n).at n=8A058818
- a(n) = A077741(n)/n.at n=41A077742
- Convoluted convolved Fibonacci numbers G_5^(r).at n=45A089109
- Number of distinct products i*j*k*l for 1 <= i < j < k < l <= n.at n=28A100438
- Analogous to the oblong (promic or heteromecic) sequence formed but with reversal digits of factors multiplied.at n=16A102069
- Numbers k such that the k-th and (k+1)-th primes have the same sum of squares of digits.at n=21A109182
- Number of (ordered) sequences of coins (each of which has value 1, 5, 10, 25, 50 or 100) which add to n.at n=31A114044
- Cubeful numbers whose neighbors are also cubeful.at n=3A122692
- a(n) = n^4 - n^3 - n^2.at n=9A132998
- a(n) = n*(8*n - 3).at n=27A139273
- Length of row n of the Kolakoski fan A143477.at n=21A143586
- Partial sums of A151789.at n=46A151790
- Terms of A177763 which have more than one such representation.at n=9A177766
- Number of n X 2 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors.at n=6A183476
- Number of nX7 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors.at n=1A183481
- T(n,k)=Number of nXk 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors.at n=34A183483
- T(n,k)=Number of nXk 0..2 arrays with every element equal to either the sum mod 3 of its vertical neighbors or the sum mod 3 of its horizontal neighbors.at n=29A183483