5658
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 12096
- Proper Divisor Sum (Aliquot Sum)
- 6438
- 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
- 1760
- Möbius Function
- 1
- Radical
- 5658
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 129
- 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 partitions into non-integral powers.at n=31A000327
- Numbers k such that k^4 can be written as a sum of four positive 4th powers.at n=39A003294
- Coordination sequence T1 for Keatite.at n=42A009844
- Iccanobif numbers: add reversal of a(n-1) to a(n-2).at n=20A014259
- Partial sums of A001935; at one time this was conjectured to agree with A007478.at n=30A014605
- In base 11, a(n) = sum of digits of Lucas(a(n)).at n=44A025491
- Graham-Sloane-type lower bound on the size of a ternary (n,3,5) constant-weight code.at n=12A030505
- G.f.: Product_{k>=1} (1 + 2*x^k).at n=29A032302
- Numbers whose set of base-7 digits is {2,3}.at n=36A032807
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,7.at n=9A064240
- Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,21.at n=12A064247
- Primitive subsequence of A066031: terms of A066031 which are not a multiple of some previous terms.at n=41A064623
- a(n) = sum of modular offsets: mod[n+c,b]-(mod[n,b]+c) for c<=b<=n.at n=36A066809
- Squarefree numbers sandwiched between a pair of twin primes.at n=42A070195
- Values of n corresponding to the terms in sequence A080155. For any k, the concatenation of the a(1) to a(k)-th primes is prime and each value of k is the smallest for which this is true.at n=46A080156
- Diagonal of A083167.at n=46A083168
- a(1) = 30; for n > 1, a(n+1) = a(n) + {product of nonzero digits of a(n)}.at n=47A095992
- Numbers k such that k^4 can be written as a sum of four distinct positive 4th powers.at n=39A096739
- Numerators of "Farey fraction" approximations to Pi.at n=42A097545
- a(n) is the smallest number m such that for the n-digit number s=10^(n-1)+ m, 10*s+1, 10*s+3, 10*s+7 and 10*s+9 are primes.at n=12A097639