8483
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 9000
- Proper Divisor Sum (Aliquot Sum)
- 517
- 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
- 7968
- Möbius Function
- 1
- Radical
- 8483
- Omega Function (Ω)
- 2
- 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
- 109
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite DDR = Deca-dodecasil 3R[Si120O240]qR starting with a T3 atom.at n=12A019111
- Expansion of Product_{m>=1} (1 + m*q^m)^17.at n=4A022645
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 91.at n=17A031589
- Numbers k such that 249*2^k+1 is prime.at n=38A032501
- Number of forests of ordered trees on n total nodes.at n=10A052854
- a(n) = C(2n-1,n-1) mod n^3.at n=31A099907
- Positive integers of the form (18*m^2+1)/11.at n=13A113338
- Number of weakly triangulated simple graphs on n unlabeled nodes.at n=7A123472
- Numbers n such that A064168(n) is prime.at n=62A123538
- 8*P_4(2n), 8 times the Legendre Polynomial of order 4 at 2n.at n=2A140870
- a(n) = A046161(n) + A001803(n).at n=7A173396
- Positive integers of the form (2*m^2+1)/11.at n=39A179088
- Number of multiset repetition class defining partitions of N with 1<=N<=n.at n=55A185976
- Number of n X 6 binary arrays without the pattern 0 1 diagonally, vertically or antidiagonally.at n=35A188863
- Numbers k such that 9^k + 4 is prime.at n=14A217384
- Number of nX4 0..1 arrays with exactly floor(nX4/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=6A222452
- Number of nX7 0..1 arrays with exactly floor(nX7/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=3A222455
- T(n,k) = Number of n X k 0..1 arrays with exactly floor(n X k/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=48A222456
- T(n,k) = Number of n X k 0..1 arrays with exactly floor(n X k/2) elements unequal to at least one horizontal, vertical or antidiagonal neighbor, with new values introduced in row major 0..1 order.at n=51A222456
- Number of nX1 0..1 arrays with all rows and columns having a nonnegative second derivative in a quadratic least squares fit, with one and two element arrays taken as having a zero second derivative.at n=13A223220