8153
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8448
- Proper Divisor Sum (Aliquot Sum)
- 295
- 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
- 7860
- Möbius Function
- 1
- Radical
- 8153
- 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
- 114
- 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
- Expansion of 1/(1-x^10-x^11-x^12-x^13-x^14-x^15-x^16-x^17-x^18).at n=71A017894
- a(n) = n*(17*n - 1)/2.at n=31A022274
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 24.at n=33A051965
- a(n) is the least odd number of the form p + k^2 with p prime and k > 0 which can be represented in exactly n different ways.at n=38A059400
- Least number which may be expressed as the sum of a prime number and a nonzero square in exactly n different ways.at n=37A064283
- a(n) = A075443(A075451(n)).at n=23A075452
- Let p and q be two prime numbers, not necessarily consecutive, such that q - p = 2n; a(n) is the number of distinct partitions of 2n into even numbers so that each partition corresponds to a consecutive prime difference pattern (k-tuple) and p<=A000230(n). Multiple occurrences of a partition are not counted.at n=45A079024
- Numbers n such that (Product of first n twin prime pair averages [A014574] ) + 1 is prime.at n=7A079139
- Start with 1 and repeatedly reverse the digits and add 71 to get the next term.at n=47A118218
- Floor(((1+sqrt(7))/2)^n).at n=15A125896
- a(n) = least k such that the remainder when 11^k is divided by k is n.at n=11A127819
- Least k such that n^k mod k = n + 1.at n=9A128172
- Number of n X n binary arrays symmetric about the diagonal and under 90 degree rotation with all ones connected only in a 1001-1111 pattern in any orientation.at n=21A146623
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, -1, 1), (1, 1, -1), (1, 1, 0)}.at n=8A148998
- Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 8, read by rows.at n=16A153653
- Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 8, read by rows.at n=19A153653
- Let f(m) = number of steps needed to reach a Harshad number when the map k->A062028(l) is iterated starting at m; a(n) = smallest m such that f(m) = n.at n=96A181664
- Numbers k such that k divides the sum of the first k primes with odd indices.at n=6A263549
- Numbers k such that k![4] - 2 is prime, where k![4] = A007662(k) = quadruple factorial.at n=34A283554
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 517", based on the 5-celled von Neumann neighborhood.at n=12A288831