7184
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
- 13950
- Proper Divisor Sum (Aliquot Sum)
- 6766
- 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
- 3584
- Möbius Function
- 0
- Radical
- 898
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 119
- 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
- Numbers k such that 73*2^k+1 is prime.at n=18A032386
- McKay-Thompson series of class 18a for Monster.at n=51A058536
- McKay-Thompson series of class 18d for the Monster group.at n=17A058539
- a(1) = 1, a(n+1) is the sum of a(n) and ceiling( arithmetic mean of a(1) ... a(n) ).at n=31A065095
- a(n) is the number of coverings of 1..n by cyclic words of length 3, such that each value from 1 to n appears precisely 3 times. That is, the union of all the letters in all of the words of a given covering is the multiset {1,1,1,2,2,2,...,n,n,n}. Repeats of words are allowed in a given covering.at n=5A108242
- Expansion of g.f. 1/((1-x^2+x^3+x^4-x^5)*(1-x-x^2+x^3-x^5)).at n=25A147598
- a(n) = 512n + 16.at n=13A157475
- Index k of the semiprime A001358(k) = prime(n) * prime(n+1).at n=38A172348
- A185243(n) is the a(n)-th triangular number.at n=40A185257
- a(n) = 4*n^2 + 3*n + 2.at n=42A185669
- Total number of even parts in the last section of the set of partitions of n.at n=32A206434
- Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 3.at n=23A209986
- a(n) = Sum_{i=0..n} digsum_8(i)^3, where digsum_8(i) = A053829(i).at n=32A231682
- Irregular triangle read by rows: T(n,i) = number of alpha-labeled graphs with n edges that do not use the label i, for 1 <= i <= n-1 and n >= 4.at n=33A245518
- Irregular triangle read by rows: T(n,i) = number of alpha-labeled graphs with n edges that do not use the label i, for 1 <= i <= n-1 and n >= 4.at n=41A245518
- Number of (n+2) X (6+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=4A252530
- Number of (5+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=5A252537
- Binary representation of base-(i-1) expansion of -n: replace i-1 with 2 in base-(i-1) expansion of -n.at n=36A256441
- Number of (2+1) X (n+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=19A258555
- Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 361", based on the 5-celled von Neumann neighborhood.at n=45A271414