6457
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7056
- Proper Divisor Sum (Aliquot Sum)
- 599
- 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
- 5860
- Möbius Function
- 1
- Radical
- 6457
- 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
- 168
- Smith Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Cubes written in base 8.at n=14A004638
- Positions of remoteness 4 in Beans-Don't-Talk.at n=25A005696
- Number of elements in Z[ i ] whose 'smallest algorithm' is <= n.at n=9A006457
- Expansion of 1/((1-4x)(1-9x)(1-12x)).at n=3A019722
- Numbers k such that the continued fraction for sqrt(k) has period 74.at n=14A020413
- Numbers n such that prime(n) mod n <= 10.at n=45A022465
- Numbers k such that prime(k) == 7 (mod k).at n=9A023149
- a(n) = (1/2)*A014431(n+2).at n=9A025235
- Number of partitions of n into an odd number of parts, the least being 4; also, a(n+4) = number of partitions of n into an even number of parts, each >=4.at n=64A027190
- Number of partitions of n with equal nonzero number of parts congruent to each of 2 and 3 (mod 4).at n=42A035551
- Number of partitions of n with equal number of parts congruent to each of 0 and 2 (mod 5).at n=40A035553
- Digit sum of 'odd' number equals digit sum of 'sum' and 'juxtaposition' of its prime factors (counted with multiplicity).at n=34A036927
- T(n,n+1), array T as in A047040; T(n+1,n), array T given by A047050.at n=8A047046
- Numbers k such that the digits of the k-th prime begin with k.at n=2A067928
- Numbers n such that, as strings, n is a substring of prime(n).at n=3A068575
- Numbers n such that n and the n-th prime have the same digits.at n=12A074350
- Number of solutions to x*frac[p(x)/x]<=Log[n] or A004648(n)<=Log[n].at n=21A099641
- Numbers k such that 10^k + 6*R_k + 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=14A102941
- Smallest k such that (10^n+k, 10^n+k+2) and (10^(n+1)+k, 10^(n+1)+k+2) are two pairs of twin primes.at n=11A224905
- Consider a number n with m decimal digits. The sequence lists the numbers n having the suffix of length m-1 in the middle of the decimal expansion of prime(n).at n=34A242957