6397
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 6398
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 6396
- Möbius Function
- -1
- Radical
- 6397
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 834
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Euler numbers written backwards.at n=9A004150
- Numbers k such that the continued fraction for sqrt(k) has period 59.at n=5A020398
- Primes of form k^2 - 3.at n=14A028874
- Trajectory of 16 under prime factor concatenation procedure.at n=10A037925
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 19.at n=20A050968
- Euclid-Mullin sequence (A000945) with initial value a(1)=11 instead of a(1)=2.at n=11A051309
- Restricted left truncatable (Henry VIII) primes.at n=5A055521
- Primes p such that x^41 = 2 has no solution mod p.at n=21A059236
- Primes p such that p^5 reversed is also prime.at n=40A059698
- Primes that are the sum of five consecutive composite numbers.at n=42A060330
- Numbers n such that n and the n-th prime have the same digits.at n=10A074350
- Smallest prime p(k) such that the number of distinct prime divisors of all composite numbers between p(k) and p(k+1) is n.at n=33A075580
- Duplicate of A075580.at n=33A077132
- Index of the first occurrence of prime(n) in A060324.at n=20A078454
- Primes p such that (3*p)^2 + p^2 + 3^2 and (3*p)^2 - p^2 - 3^2 are both prime.at n=17A079796
- Numbers k such that there are exactly 8 numbers j for which binomial(k, floor(k/2)) / binomial(k,j) is an integer, i.e., A080383(k) = 8.at n=40A080386
- Third row of number array A082105.at n=39A082109
- Primes in which odd positioned digits are prime and even positioned digits are composite. The least significant digit is taken to be the first digit.at n=40A083820
- Triangle T(n, k) read by rows; given by [1, 1, 1, 1, 1, ...] DELTA [1, 1, 2, 5, 14, 42, 132, 429, 1430, ...] (A000108) where DELTA is Deléham's operator defined in A084938.at n=29A085843
- Primes p = prime(n) such that p + sum-of-digits(p) +- 1 = prime(n+1).at n=34A090180