8465
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10164
- Proper Divisor Sum (Aliquot Sum)
- 1699
- 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
- 6768
- Möbius Function
- 1
- Radical
- 8465
- 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
- 83
- 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
- Maximal number of states in the minimal deterministic finite automaton accepting a language over a binary alphabet consisting of some words of length n.at n=16A000802
- Strong pseudoprimes to base 92.at n=19A020318
- Numbers whose set of base-16 digits is {1,2}.at n=22A032936
- a(n) = n^3 + (n + 1)^4 + (n + 2)^5.at n=4A061223
- Numbers n such that n = pi(n)*k + 1 for some k.at n=26A065136
- First occurrence of n in the modified Juggler sequence.at n=45A095909
- a(n) = 16*n^2 + 1.at n=22A108211
- Expansion of g.f. (1 + 2*x)^4/((1 + x)*(1 - 16*x^2)).at n=6A114014
- Composite number of the form 4n^2+1.at n=28A121944
- Semiprimes of the form k^2+1.at n=41A144255
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1110-0111 pattern in any orientation.at n=13A146475
- a(n) = 529*n + 1.at n=15A158368
- Positions where A163890 obtains distinct new values.at n=18A163891
- a(n) = 9*n^2 - 6*n + 2.at n=30A185939
- Semiprimes which are one more than a perfect power.at n=48A189047
- Number of n X 4 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=5A207415
- Number of nX6 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=3A207417
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=39A207419
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=41A207419
- Number of (n+1) X (4+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=8A250725