6202
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10656
- Proper Divisor Sum (Aliquot Sum)
- 4454
- 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
- 2652
- Möbius Function
- -1
- Radical
- 6202
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 155
- 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
- yes
- Odd
- no
Appears in sequences
- Number of n X n symmetric matrices with nonnegative integer entries, trace 0 and all row sums 2.at n=8A002137
- Fibonacci sequence beginning 1, 26.at n=13A022396
- Write 1,2,... in a clockwise spiral; sequence gives numbers on positive x axis.at n=39A033951
- Numbers having four 4's in base 6.at n=13A043388
- a(n) = (n + 2)*(2*n^2 - n + 3)/6.at n=26A056520
- Numbers n such that n | 10^n + 9^n + 1.at n=24A057295
- 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=42A067356
- Least integer m such that between m and 2m there are n triangular numbers.at n=46A085762
- G.f.: (1+x^5+x^7+x^8+x^10+x^15)/((1-x^2)(1-x^3)(1-x^4)(1-x^6)^2(1-x^9)).at n=55A089599
- Triangle read by rows: T(n,k) is the number of multigraphs without loops on n labeled nodes with k edges and maximum degree 2.at n=34A095693
- Triangle read by rows: T(n,k) is the number of multigraphs without loops on n labeled nodes with k edges and maximum degree 2.at n=44A095693
- 1 + sum of first n 4-almost primes.at n=39A110226
- Number of elements of rows of Golomb's sequence A001462, with one less 2, interpreted as triangle: Start with first row 1. The row sum of row n-1 gives the number of elements taken from A001642 (one less 2) of row n.at n=6A113676
- G.f.: A(x) = 1+x*(1+x*(1+x*(...(1+x*(...)^(-n) )...)^-3)^-2)^-1.at n=7A121587
- a(n) = 1 + (144 + (50 + (35 + (10 + n)*n)*n)*n)*n/120.at n=13A145127
- Number of n X n arrays of squares of integers with every (n-1)X(n-1) subblock summing to 10 and every element equal to at least one neighbor.at n=2A146342
- a(n) = 4*n^2 + 28*n + 10.at n=35A153644
- a(n) = n*(7*n^2 - 3*n - 1)/3.at n=14A214659
- Numbers n such that Q(sqrt(n)) has class number 10.at n=36A218042
- Minimum even value unattainable as the sum of 6 attained values of i*(i-1) with i in 0..n.at n=34A225292