6068
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 11172
- Proper Divisor Sum (Aliquot Sum)
- 5104
- 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
- 2880
- Möbius Function
- 0
- Radical
- 3034
- Omega Function (Ω)
- 4
- 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
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Metadromes: digits in base 7 are in strict ascending order.at n=62A023776
- Exactly half of first a(n) terms of A022300 are 1's (not known to be infinite).at n=3A025513
- Numbers k such that k^4 == 1 (mod 5^4).at n=38A056091
- Period of the continued fraction for sqrt(2^(2n+1)).at n=13A059927
- Write 0,1,2,3,4,... in a triangular spiral; then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0,2,...at n=37A062708
- Numbers k such that the sum of primes dividing k (with repetition) / smallest prime dividing k = largest prime dividing k.at n=36A085702
- (prime(n-1) + 1)*(prime(n+1) - 1).at n=20A087105
- Sign twisted convoluted convolved Fibonacci numbers H_7^(r).at n=13A089114
- Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 67, the third irregular prime.at n=5A093059
- Ratio A095106(n)/A095093(n) rounded down.at n=20A095355
- Indices of primes in sequence defined by A(0) = 93, A(n) = 10*A(n-1) + 43 for n > 0.at n=8A101015
- Positive integers m such that the largest prime-power divisor of m equals the sum of the other maximal prime-power divisors (> 1) of m.at n=44A112343
- 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, -1, 1), (-1, 0, 0), (0, 0, 1), (0, 1, -1), (1, 0, -1)}.at n=9A148564
- a(n) = 289*n - 1.at n=20A158253
- a(n) is the number of n-tosses having a run of 3 or more heads and a run of 3 or more tails for a fair coin.at n=13A167826
- Conjecturally, even numbers n such that every even number greater than n has more decompositions as the sum of two primes.at n=37A174327
- a(n) = 4*A060819(n-2)*A060819(n+2).at n=41A181829
- a(n) is the number of initial persons such that the n-th person survives in the duck-duck-goose game.at n=10A182459
- A185128(n) is the a(n)-th triangular number.at n=38A185223
- G.f.: Sum_{n>=0} Product_{k=1..n} Series_Reversion( x/(1 + x^k) ).at n=18A206290