8833
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 9842
- Proper Divisor Sum (Aliquot Sum)
- 1009
- 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
- 7920
- Möbius Function
- 0
- Radical
- 803
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 78
- 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
- no
- Odd
- yes
Appears in sequences
- Number of connected graphs with n nodes and n+1 edges.at n=10A001435
- A nonlinear recurrence: a(n) = a(n-1)^2 - 6*a(n-1) + 6, with a(0) = 1, a(1) = 7.at n=4A001544
- Numbers k such that the continued fraction for sqrt(k) has period 74.at n=26A020413
- Numerators of continued fraction convergents to sqrt(687).at n=6A042320
- Triangle of number of connected graphs with k >= 1 edges and n nodes (2 <= n <= k+1).at n=75A046742
- T(n,n-3), array T as in A047060.at n=7A047065
- Triangle read by rows: number of connected graphs with k >= 0 edges and n nodes (1<=n<=k+1).at n=88A054923
- Number of rooted trees with n nodes and 6 leaves.at n=7A055281
- Numbers, with an even number of digits, that are the sum of the squares of their two halves (leading zeros allowed only for the second half).at n=1A055616
- Decimal numbers n such that after possibly prefixing leading 0's to n, the resulting number n' can be broken into 2 numbers of equal length, n' = xy, such that x^2+y^2 = n (y may also have leading zeros).at n=2A064942
- Numbers that are the sum of the squares of some substring decomposition of themselves.at n=7A085251
- Decimal numbers n such that after possibly prefixing a leading 0 to n, the resulting number n' can be broken into 2 strings of the same length, n' = xy, such that x^2+y^2 = n.at n=2A101311
- n and pi(n) are both made of nontrivial runs of identical digits, where pi(n)=A000720(n).at n=1A116056
- Row sums of triangle A131321.at n=13A131322
- a(n) = (3*n+1)*(5*n+1).at n=24A144459
- a(n) = A145812(2n-1).at n=44A145849
- Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 3X2 zee 1,1 1,2 1,3 2,3 2,4 in any orientation.at n=9A146128
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 0), (0, 1), (1, -1), (1, 0)}.at n=10A151408
- Partial sums of A151782.at n=24A151793
- a(n) = 8*n^2 + 20*n + 1.at n=32A161617