8073
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
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 13440
- Proper Divisor Sum (Aliquot Sum)
- 5367
- 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
- 4752
- Möbius Function
- 0
- Radical
- 897
- Omega Function (Ω)
- 5
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 96
- Smith Number
- yes
- 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
- Consider a 2-D cellular automaton generated by the Schrandt-Ulam rule of A170896, but confined to a semi-infinite strip of width n, starting with one ON cell at the top left corner; a(n) is the period of the resulting structure.at n=42A006447
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 1 and a(1) = 11.at n=15A022325
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=27A025104
- Probable extension of A013704.at n=17A025495
- a(n) = T(2n,n), where T is the array in A026323.at n=6A026332
- a(n) = T(n,[ n/2 ]), where T is the array in A026323.at n=12A026336
- Numbers whose base-6 representation has exactly 6 runs.at n=32A043614
- Beginning of n consecutive quadratic residues mod A025046(n).at n=31A048282
- Expansion of 1/(1-3*x-x^3).at n=8A052541
- Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives j values.at n=37A053720
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals 3n.at n=39A070899
- Expansion of (1+x^2*C)*C^4, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.at n=7A071719
- Sum of terms of n-th group in A075383.at n=22A075386
- Average of three successive primes squared, (prime(n)^2+prime(n+1)^2+prime(n+2)^2)/3, n>=3.at n=20A075893
- Beginning with 1, numbers such that the differences a(k)-a(k-1) are distinct and every concatenation n>1 is prime.at n=43A090504
- Bases of the n-th powers in A090900.at n=29A110042
- Triangle W, read by rows, where column k of W = column 0 of W^(k+1) for k>=0 such that W equals the matrix cube of P = A136220 with column 0 of W = column 0 of P shift up one row.at n=41A136231
- Numerator of Euler(n, 8/25).at n=3A156975
- First terms "a" of quadruples a>b>c>d>0 with six square pairwise sums.at n=15A175534
- Quadruples a>b>c>d>0 such that six pairwise sums and the total sum are all squares.at n=3A175535