6458
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
- 4
- Divisor Sum
- 9690
- Proper Divisor Sum (Aliquot Sum)
- 3232
- 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
- 3228
- Möbius Function
- 1
- Radical
- 6458
- Omega Function (Ω)
- 2
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 75
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Numbers n such that n is a substring of its square in base 6 (written in base 10).at n=31A018830
- Numbers k such that the continued fraction for sqrt(k) has period 27.at n=26A020366
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 6.at n=22A031419
- Numbers n such that prime(n) == -1 (mod n).at n=10A045924
- Duplicate of A045924.at n=10A049204
- a(n) = Sum_{i=1..n} T(i,n-i), where T is A049615.at n=43A049616
- E.g.f.: (log(1-x))^2/(1+log(1-x)).at n=6A052864
- Numbers n such that 1n1, 3n3, 7n7 and 9n9 are all primes.at n=12A059677
- Nonprimes k such that k divides prime(k)^2 - 1.at n=50A064938
- Smallest of four consecutive integers divisible by four consecutive primes respectively.at n=38A072555
- Numbers k that divide prime(k)+1 or prime(k)-1.at n=15A078931
- Numbers k such that T(k) = T(A072522(k)) + T(A072522(k+1)), T(i) being the triangular numbers.at n=19A080824
- a(n) is the smallest number m such that prime(m) = n*m - 1, or 0 if no such m exists.at n=9A108511
- a(n) = Sum_{k=1..n} floor(n^2/k).at n=39A118014
- Binary digits, representing the rows of triangle A141728, written in base 10.at n=9A141734
- Partial sums of A160414.at n=18A161325
- Where zeros occur in the 1-0 race in the binary expansion of Pi-3; that is, n such that A174832(n) = 0.at n=14A178980
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 30", based on the 5-celled von Neumann neighborhood.at n=26A269755
- Numbers n such that prime(n) + prime(n+1) is divisible by 2n + 1.at n=2A278693
- Numbers k such that floor(prime(k)/k) < floor(prime(k+1)/(k+1)).at n=12A308082