6431
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6600
- Proper Divisor Sum (Aliquot Sum)
- 169
- 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
- 6264
- Möbius Function
- 1
- Radical
- 6431
- 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
- 124
- 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
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly seven 1's.at n=30A020443
- Triangle read by rows: T(n,k) = number of k-covers of a labeled n-set, k=1..2^n-1.at n=17A055154
- Numbers k such that k(3k-2) is an octagonal palindrome.at n=5A057106
- Numbers k such that x^k + x^3 + 1 is irreducible over GF(2).at n=31A057461
- Numbers n such that x^n + x^3 + x^2 + x + 1 is irreducible over GF(2).at n=24A057496
- Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; a(n) is the number of distinct partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p<=A000230(n). Multiple occurrences of a partition are not counted.at n=39A079024
- Numbers k such that numerator of Bernoulli(2k) is divisible by the square of 59, the second irregular prime.at n=8A093058
- Odd numbers n for which 17 is the smallest i (>= 1) with Jacobi symbol J(i,n) getting either a value 0 or -1.at n=4A112077
- Number of partitions of an n-element set avoiding the pattern 12|3.at n=10A128816
- Numbers that are the product of two distinct primes a and b, such that a^3+b^3 is the average of a twin prime pair.at n=23A176876
- Semiprimes for which dropping any digit gives a prime number.at n=41A178423
- Products of exactly two Pillai primes.at n=36A181414
- Discriminants D < 0 such that h(D) > h(D') for D < D' < 0, negated.at n=45A225060
- Semiprimes with digits in strictly decreasing order.at n=43A235108
- Integers k such that (k^2 + (k+1)^2) has no square proper substring.at n=54A238903
- a(n) is the minimum number greater than a(n-1) such that the concatenation a(n) U a(n-1) U ... U a(1) is a Niven number, starting with a(1)=1.at n=33A239543
- Least number k >= 0 such that (n!-k)/n is prime.at n=56A245696
- Egyptian fraction representation of sqrt(75) (A010527) using a greedy function.at n=4A248299
- Expansion of Product_{k>=1} (1 + x^(2*k-1))^k.at n=33A263140
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 595", based on the 5-celled von Neumann neighborhood.at n=18A273142