6231
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8704
- Proper Divisor Sum (Aliquot Sum)
- 2473
- 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
- 3960
- Möbius Function
- -1
- Radical
- 6231
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 62
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Triangular numbers written backwards.at n=51A004158
- Expansion of g.f. 1/((1-x)*(1-2*x)*(1-8*x)).at n=4A016203
- First row of spectral array W(sqrt(3)).at n=20A022159
- a(n) = n*(13*n - 1)/2.at n=31A022270
- a(n) = least m such that if r and s in {1/1, 1/2, 1/3, ..., 1/n} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=36A024846
- a(n) = Sum_{d|n} sigma(n/d)*d^3.at n=15A027847
- 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 52.at n=24A031550
- Number of partitions of n into parts not of the form 19k, 19k+4 or 19k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 8 are greater than 1.at n=33A035973
- Numbers whose base-5 representation contains exactly three 1's and three 4's.at n=9A045262
- Starting from generation 8 add previous and next term yielding generation 9.at n=8A048455
- Last odd terms from generation 2 onwards.at n=7A048457
- Odd numbers in sorted order from generation 2 onwards.at n=24A048462
- Indices of primes in sequence defined by A(0) = 11, A(n) = 10*A(n-1) + 51 for n > 0.at n=9A056247
- a(n) = (2*n-1)*(5*n^2-5*n+6)/6.at n=15A063489
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k)-k*tau(k) where tau(k) = A000005(k) is the number of divisors of k.at n=43A067356
- Numbers which yield a prime whenever a 1 is inserted anywhere in them (including at the beginning or end).at n=54A068679
- a(1) = 8; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=42A074344
- Greedy frac multiples of log(2): a(1)=1, Sum_{n>0} frac(a(n)*log(2)) = 1.at n=10A079941
- Denominators of the convergents of the continued fraction for log(2).at n=11A079943
- Smallest nontrivial multiple of n ending in n. By nontrivial one means a(n) is not equal to n or concatenation of n with itself.at n=30A083466