6192
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 17732
- Proper Divisor Sum (Aliquot Sum)
- 11540
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2016
- Möbius Function
- 0
- Radical
- 258
- Omega Function (Ω)
- 7
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 124
- 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
- Nearest integer to Bernoulli number B_{2n}.at n=11A002882
- From a nim-like game.at n=31A003412
- Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (2,2,2).at n=3A005548
- Number of n-edge 3-connected planar maps with a sense-reversing automorphism.at n=21A006445
- Aliquot sequence starting at 180.at n=12A008891
- Truncation of Bernoulli number: floor(|B_2n|) * sign(B_2n).at n=11A014509
- Expansion of 1/((1-2x)(1-10x)(1-12x)).at n=3A016326
- Numerator of sum of -3rd powers of divisors of n.at n=34A017669
- a(n) = number of (s(0), s(1), ..., s(n)) such that s(i) is an integer, s(0) = 0, |s(1)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2, s(n) = 4. Also a(n) = T(n,n-4), where T is the array defined in A025177.at n=7A025182
- a(n)=(s(n)+4)/10, where s(n)=n-th base 10 palindrome that starts with 6.at n=41A043085
- Sum of first n palindromic primes A002385.at n=18A046485
- Number of rooted trees with n nodes and 3 leaves.at n=21A055278
- Numbers which are the sum of their proper divisors containing the digit 0.at n=37A059461
- Numbers k such that sigma(x) = k has exactly 6 solutions.at n=26A060662
- First (leftmost) digit - second digit + third digit - fourth digit .... = 12.at n=44A061881
- a(n)= Sum_{j=0..floor(n/2)} A073145(2*j + q), where q = 2*(n/2 - floor(n/2)).at n=31A074585
- a(n) is the smallest k such that the sum of the first k terms of the composite-harmonic series, Sum_{j=1..k} 1/(j-th composite), is > n.at n=5A074631
- Final members of groups in A076105.at n=32A076102
- Number of positions that are exactly n moves from the starting position in the Rashkey Type 2 puzzle.at n=18A079857
- a(n) = n^2 + (n concatenated with n).at n=42A105814