8056
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 16200
- Proper Divisor Sum (Aliquot Sum)
- 8144
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3744
- Möbius Function
- 0
- Radical
- 2014
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 96
- 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) = floor(n(n+2)(2n+1)/8).at n=31A002717
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 15 ones.at n=6A031783
- Expansion of (x^3+2*x+1) / ((x-1)^4*(x^2+x+1)^2).at n=45A038391
- Denominators of continued fraction convergents to sqrt(498).at n=5A041951
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m), where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n-1 <= 2^(p+1), starting with a(1) = a(2) = 1.at n=13A049941
- a(n) = 4*n^2 - 9*n + 6.at n=45A054556
- Number of rooted trees with n nodes and 9 leaves.at n=5A055284
- Records in A065925.at n=15A065927
- Finite sequence of iterations at which Langton's Ant passes through the origin.at n=26A102358
- Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n, having k (1,1)-steps on the lines y=x, y=x+1 and y=x-1.at n=31A110183
- Smallest number k such that k^n is equal to the sum of n consecutive primes, or 1 if it does not exist.at n=45A123112
- Numbers n such that n^3 is zeroless pandigital.at n=35A124628
- Sum of the cubes of the number of standard Young tableaux over all partitions of n.at n=6A130721
- a(n) = (4*n^3 + 11*n^2 + 9*n + 2)/2.at n=15A135712
- Least of 4 consecutive integers such that their product +-5 are primes.at n=44A174244
- Number of permutations of 0..(n-1) representable as 1,4,6,4,1-weighted consecutive sums of 5 adjacent elements of a sequence of n+4 nonnegative integers.at n=22A180215
- Number of nondecreasing arrangements of n+2 numbers in 0..8 with the last equal to 8 and each after the second equal to the sum of one or two of the preceding four.at n=18A189325
- Number of rhombuses on a (n+1)X9 grid.at n=26A190097
- Number of partitions of n such that the number of parts and the largest part and the smallest part are pairwise coprime.at n=34A201218
- Sum of the k-th powers of the numbers of standard Young tableaux over all partitions of n; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=51A208447