8433
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
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 12194
- Proper Divisor Sum (Aliquot Sum)
- 3761
- 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
- 5616
- Möbius Function
- 0
- Radical
- 2811
- 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
- 83
- 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
- Tricapped prism numbers.at n=17A005920
- Three-fold exponential convolution of primes with themselves (divided by 2).at n=5A014348
- Triangle of coefficients of generating function of 5-ary rooted trees of height at most n.at n=60A036607
- Number of 5-ary rooted trees with n nodes and height at most 4.at n=18A036615
- Number of 6-ary rooted trees with n nodes and height exactly 6.at n=14A036644
- Numbers k such that k^4 can be written as a sum of four positive 4th powers with no common factor.at n=24A039664
- Denominators of convergents to A058914.at n=20A048818
- Centered 17-gonal numbers: (17*n^2 - 17*n + 2)/2.at n=31A069130
- Triangle, read by rows, where the n-th row is the first n terms of the n-th self-convolution of the sequence formed by flattening this triangle.at n=42A086606
- a(0) = 0, a(1) = 1 and for n >= 2, a(n) = floor(sqrt(2 * (a(n-2)^2 + a(n-1)^2))).at n=20A093332
- Vertex number of a rectangular spiral related to Fibonacci numbers and prime numbers. The distances between nearest edges of the spiral that are parallel to the initial edge are the Fibonacci numbers, while the distances between nearest edges perpendicular to the initial edge are the prime numbers.at n=32A160794
- Number of binary strings of length n with equal numbers of 00001 and 11011 substrings.at n=14A164210
- Numbers n such that Mordell's equation y^2 = x^3 + n has exactly 12 integral solutions.at n=17A179154
- Triangle T(n,m), [x*A(x)]^m=sum(n>=m T(n,m)*x^n), where A(x) satisfies x*A(x)^2= -(2*x*A(x)+sqrt(1-4*x*A(x))-1)/(4*x*A(x)+sqrt(1-4*x*A(x))-1).at n=23A188109
- Number of (w,x,y,z) with all terms in {0,...,n} and w=2*floor((x+y+z)/2).at n=34A212748
- Number of ways 1/n can be expressed as the sum of four distinct unit fractions: 1/n = 1/w + 1/x + 1/y + 1/z satisfying 0 < w < x < y < z.at n=11A241883
- a(1) = 1; for n>1, a(n) = smallest number > a(n-1) such that the pairwise differences of elements are distinct, and for 1<m<n, a(m) does not divide a(n).at n=47A256062
- Halogen sequence: a(n) = A018227(n)-1.at n=34A271999
- E.g.f.: A(x) = exp( Integral A(x)^x dx ).at n=8A274739
- Number of 2 X 2 matrices with all terms in {0,1,...,n} and (sum of terms) = determinant.at n=45A280588