8336
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 16182
- Proper Divisor Sum (Aliquot Sum)
- 7846
- 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
- 4160
- Möbius Function
- 0
- Radical
- 1042
- Omega Function (Ω)
- 5
- 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
- 127
- 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*phi^13), where phi is the golden ratio, A001622.at n=16A004928
- a(n) = round(n*phi^13), where phi is the golden ratio, A001622.at n=16A004948
- McKay-Thompson series of class 42b for Monster.at n=47A058676
- Sum of distinct orders of degree-n permutations.at n=22A060179
- Numbers k such that k and k^2 use only the digits 3, 4, 6, 8 and 9.at n=14A137129
- Coefficients of a special case of Poisson-Charlier polynomials. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=29A137346
- Concatenation of first two digits and last two digits of n-th even perfect number.at n=32A138875
- Floor(Fibonacci(2n+1)/9).at n=12A156561
- Number of nonisomorphic connected circle graphs of order n.at n=7A156808
- a(n) = ((2+sqrt(5))*(3+sqrt(5))^n + (2-sqrt(5))*(3-sqrt(5))^n)/2.at n=5A162771
- Sum of the numbers already killed in the first jump of a Sieve of Eratosthenes table.at n=22A179628
- Number of n X n symmetric binary matrices with each 1 adjacent to no more than 3 king-move neighboring 1s.at n=4A191479
- [s(k)-s(j)]/9, where the pairs (k,j) are given by A205872 and A205873, and s(k) denotes the (k+1)-st Fibonacci number.at n=23A205875
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209773; see the Formula section.at n=41A209776
- Number of nondecreasing sequences of n 1..5 integers with every element dividing the sequence sum.at n=49A212533
- Number of distinct lines passing through 3 or more points in an n X n grid.at n=21A225606
- Number of (n+1) X (1+1) 0..5 arrays with every 2 X 2 subblock having the sum of the squares of the edge differences equal to 10, and no two adjacent values equal.at n=3A233951
- Number of (n+1)X(4+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10, and no two adjacent values equal.at n=0A233954
- T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10 (10 maximizes T(1,1)), and no two adjacent values equal.at n=6A233958
- T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10 (10 maximizes T(1,1)), and no two adjacent values equal.at n=9A233958