8152
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15300
- Proper Divisor Sum (Aliquot Sum)
- 7148
- 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
- 4072
- Möbius Function
- 0
- Radical
- 2038
- Omega Function (Ω)
- 4
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 65
- 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
- Number of n-step self-avoiding walks on f.c.c. lattice from (0,0,0) to (0,0,2).at n=4A003288
- Numbers k such that the continued fraction for sqrt(k) has period 70.at n=28A020409
- a(n) = Sum_{k=0..2n-1} T(n,k)*T(n,k+1), T given by A027926.at n=6A027995
- 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 21.at n=42A031519
- Number of point symmetric solutions to non-attacking queens problem on n X n board.at n=16A032522
- (s(n)+2)/10, where s(n)=n-th base 10 palindrome that starts with 8.at n=37A043087
- Numbers k such that 27*2^k-1 is prime.at n=29A050539
- Susceptibility series H_3 for 2-dimensional Ising model (divided by 2).at n=12A054410
- Integers that can be expressed as the sum of consecutive primes in exactly 4 ways.at n=27A054999
- Composite n such that phi(n+4) = phi(n)+4.at n=45A056773
- Positive numbers whose product of digits is 5 times their sum.at n=43A062382
- Square spiral sequence: numbers are placed in a square spiral, a(1)=1, a(n) is found as the sum of the row (in the previous direction) a(n-1) is in.at n=22A062410
- Integers expressible as the sum of (at least two) consecutive primes in at least 4 ways.at n=17A067374
- a(n) = (11*n^2 - 11*n + 2)/2.at n=38A069125
- a(n) = A104908(n) - 10*A104863(n).at n=29A104909
- Sum of primes q with prime(n) < q < 2*prime(n).at n=41A108313
- Number of nondecreasing arrangements of 4 numbers in -(n+2)..(n+2) with sum zero and not more than two numbers equal.at n=29A188237
- a(n) = (n^3 - 2*n^2 + 3*n + 2)/2.at n=26A189890
- Constant term of the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=14A192975
- Number of n-length words w over binary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.at n=15A213290