5738
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9120
- Proper Divisor Sum (Aliquot Sum)
- 3382
- 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
- 2700
- Möbius Function
- -1
- Radical
- 5738
- 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
- 36
- 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
- yes
- Odd
- no
Appears in sequences
- Number of strict 3rd-order maximal independent sets in path graph.at n=40A007384
- Generalization of the golden ratio (expansion of (5-13x)/((1+x)(1-4x))).at n=6A007572
- Coordination sequence T7 for Zeolite Code MFS.at n=47A008179
- Coordination sequence T4 for Zeolite Code SGT.at n=47A008232
- Powers of fifth root of 22 rounded down.at n=14A018177
- Powers of fifth root of 22 rounded to nearest integer.at n=14A018178
- a(n) = [ (3rd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+2 positive integers congruent to 2 mod 3}.at n=9A024399
- a(n) = T(2n-1,n), where T is the array in A026098.at n=35A026102
- a(n) = n*(4*n-1).at n=38A033991
- Partial sums of A000009 (partitions into distinct parts).at n=37A036469
- Numbers having three 7's in base 9.at n=26A043483
- Numbers whose base-4 representation contains exactly three 1's and four 2's.at n=1A045104
- Unitary untouchable numbers: us(x) = n has no solution where us(x) (A063919) is the sum of the proper unitary divisors of x.at n=37A063948
- Local maxima of A053707 (first differences of A025475, powers of a prime but not prime).at n=36A088365
- Row sums of triangle A097094 and also equals the self-convolution of A097097 (antidiagonal sums of triangle A097094).at n=14A097096
- Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and having height of the first peak equal to k.at n=32A108437
- Numbers k such that (31*10^k - 121) / 9 is prime.at n=24A111247
- a(n) = Sum_{k=1..n} floor(n^2/k).at n=37A118014
- Numbers whose trajectory under the Esucarys map ends at the fixed point 247.at n=6A129133
- Least K such that K*(prime(100*n)^(100*n))-1 is prime with prime(n)=n-th prime.at n=37A129245