6331
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6832
- Proper Divisor Sum (Aliquot Sum)
- 501
- 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
- 5832
- Möbius Function
- 1
- Radical
- 6331
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 54
- 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
- a(n) = 2*n*a(n-1) + 1 with a(0) = 1.at n=5A010844
- Numbers k such that the continued fraction for sqrt(k) has period 66.at n=26A020405
- Sum of squares of first n positive integers congruent to 1 mod 3.at n=12A024215
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 40 ones.at n=27A031808
- Lucky numbers with size of gaps equal to 14 (lower terms).at n=31A031896
- Numerators of continued fraction convergents to sqrt(806).at n=6A042554
- Binomial transform of Kolakoski sequence A000002.at n=12A054355
- Numbers k such that k(3k-2) is an octagonal palindrome.at n=4A057106
- Numbers k such that sigma(k) - phi(k) is a cube.at n=29A062385
- Numbers n such that n and the n-th prime have the same digits.at n=8A074350
- Numbers k such that (10^k - 1)/9 + 7*10^floor(k/2) is a palindromic wing prime (a.k.a. near-repdigit palindromic prime).at n=7A077791
- Least k such that the distance from k^2 to closest prime = n or zero if no k exists.at n=45A079666
- Floor(n^3/8).at n=37A081276
- Numbers k such that 5*10^k - 3 is prime.at n=16A103003
- Numbers k such that A003313(k) = A003313(3*k).at n=38A116459
- Semiprimes which are divisible by the sum of their digits.at n=41A118693
- a(n) = the multiple of n which is > (sum{k=1 to n-1} a(k)) and is <= (n + sum{k=1 to n-1} a(k)).at n=12A128020
- Numbers k such that the sum of the first k Catalan numbers, C_1 + C_2 + ... + C_k, is divisible by k.at n=3A133927
- Square array, read by antidiagonals: form the Euler-Seidel matrix for the sequence {2^k*k!} and then divide column k by 2^k*k!.at n=15A143411
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 0, 1), (0, 1, -1), (1, 1, -1)}.at n=8A148887