8050
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 17856
- Proper Divisor Sum (Aliquot Sum)
- 9806
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2640
- Möbius Function
- 0
- Radical
- 1610
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 70
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = round(n*phi^12), where phi is the golden ratio, A001622.at n=25A004947
- a(n) = ceiling(n*phi^12), where phi is the golden ratio, A001622.at n=25A004967
- Number of words of length n in a certain language.at n=41A005819
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = floor( n/2 ), s = natural numbers >= 2, t = natural numbers >= 3.at n=41A024869
- a(n) = Sum_{i=0..n} Sum_{j=i..2*i} A027052(i, j).at n=9A027068
- Denominators of continued fraction convergents to sqrt(893).at n=10A042727
- Internal digits of n^2 include digits of n as subsequence.at n=29A046834
- Integer averages of two successive perfect powers (pp(n) + pp(n+1))/2.at n=22A075454
- Numbers k such that (3*2^k+1)^2-2 is prime.at n=18A100912
- Triangular matrix T, read by rows, that satisfies: T^2 + 2*T = SHIFTUP(T), also T^(n+1) + 2*T^n = SHIFTUP(T^n - D*T^(n-1)) for all n, where D is a diagonal matrix with diagonal(D) = diagonal(T) = {1,2,3,...}.at n=32A103236
- Number of isomers of polyhex hydrocarbons with C_(2h) symmetry with eighteen hexagons.at n=7A120371
- a(n) = 2*a(n-1) - a(n-2) + 2*(prime(n+1)-prime(n)); a(1) = 2, a(2) = 3.at n=44A122263
- Number triangle T(n,k)=(-1)^(n-k)*(3k+2)*C(3n+1, n-k)/(2n+k+2).at n=40A124821
- a(n) = (n-5)*(n-6)*(n-7)*(n-16)/24.at n=22A167543
- Even almost practical numbers.at n=31A174534
- spt(n) - p(n): total number of smallest parts in all partitions of n minus the number of partitions of n.at n=25A215513
- Unmatched value maps: number of n X 2 binary arrays indicating the locations of corresponding elements not equal to any horizontal or vertical neighbor in a random 0..1 n X 2 array.at n=8A218759
- T(n,k)=Unmatched value maps: number of nXk binary arrays indicating the locations of corresponding elements not equal to any horizontal or vertical neighbor in a random 0..1 nXk array.at n=46A218765
- a(n) = (n^2 + 2*(Sum_{j = 1..n} j^n)) (mod n^3).at n=29A219540
- Numbers that are midway between the nearest square and the nearest cube.at n=15A233075