6459
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
- 4
- Divisor Sum
- 8616
- Proper Divisor Sum (Aliquot Sum)
- 2157
- 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
- 4304
- Möbius Function
- 1
- Radical
- 6459
- 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
- no
- Odd
- yes
Appears in sequences
- Erdős-Selfridge function: a(n) is the least number m > n+1 such that the least prime factor of binomial(m, n) is > n.at n=32A003458
- Numbers n such that prime(n) mod n <= 10.at n=46A022465
- Numbers k such that prime(k) == 1 (mod k).at n=7A023143
- a(n) = T(n,m) + T(n,m+1) + ... + T(n,n), m=[ (n+1)/2 ], T given by A026747.at n=12A026869
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 79.at n=23A031577
- Denominators of continued fraction convergents to sqrt(750).at n=11A042445
- Numbers k such that 2*10^k + 3*R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=19A056701
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 79 ).at n=25A063352
- Nonprimes k such that k divides prime(k)^2 - 1.at n=51A064938
- Numbers k that divide the average of prime(k-1) and prime(k+1).at n=7A066828
- Numbers k such that the digits of the k-th prime begin with k.at n=3A067928
- Numbers n such that, as strings, n is a substring of prime(n).at n=4A068575
- Values of transition of A072608(n) from alternating behavior (0,1,0,1,..) into steadily-1 (1,1,1,..) behavior or changing back. Expressing in terms of A072609(n): at n values it switches from steadily 0 into steadily 1 successive values or back.at n=13A072610
- Numbers k that divide prime(k)+1 or prime(k)-1.at n=16A078931
- Positive numbers k such that the number of primes between k and 2*k is different from the number of primes between m and 2*m for every number m != k.at n=39A084142
- Number of solutions to x*frac[p(x)/x]<=Log[n] or A004648(n)<=Log[n].at n=22A099641
- Sum_{k=1..n} {number of partitions of n into powers k^m where 0<=m<n}.at n=7A102434
- n+prime(n)+prime(prime(n)) is a triangular number, where prime(n) is the n-th prime.at n=12A116010
- INVERT transform of A118434, = row sums of triangle A144182.at n=16A144181
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1101-0111-0100 pattern in any orientation.at n=13A146861