7948
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 13916
- Proper Divisor Sum (Aliquot Sum)
- 5968
- 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
- 3972
- Möbius Function
- 0
- Radical
- 3974
- Omega Function (Ω)
- 3
- 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
- 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
- Number of 3's in n-th term of A022470.at n=37A022474
- Base-9 palindromes that start with 1.at n=37A043028
- Numbers having four 1's in base 9.at n=25A043460
- Numbers whose base-4 representation contains exactly three 0's and three 3's.at n=27A045079
- A Diaconis-Mosteller approximation to the Birthday problem function.at n=36A050255
- a(n) = A080313(n)/2.at n=7A080315
- a(n) = sum of the first n upper twin primes.at n=29A086168
- Number of isomers of polyhex hydrocarbons with C_(2h) symmetry with nineteen hexagons.at n=8A120386
- 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, -1, 0), (-1, 0, -1), (0, 0, 1), (1, 1, -1)}.at n=10A148213
- 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, 0), (-1, 0, 0), (-1, 0, 1), (1, 0, 0), (1, 1, -1)}.at n=9A148613
- 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, 1, -1), (0, 1, 1), (1, -1, 0), (1, 1, -1)}.at n=8A149002
- Sum of a positive square and a positive cube in at least three ways.at n=13A171385
- Numbers n such that Mordell's equation y^2 = x^3 + n has exactly 12 integral solutions.at n=16A179154
- G.f. satisfies: A(x) = exp( Sum_{n>=1} x^n/n * Product_{d|n} A(d*x^d)^n ).at n=9A205501
- Number of partitions of n such that the number of parts having multiplicity >1 is a part and the number of distinct parts is a part.at n=39A241409
- a(1)=1 and a(n+1) is the smallest number m such that A244446(a(n)) < A244446(m).at n=7A246624
- Indices of even terms in A249064.at n=32A249557
- Number of (n+2)X(n+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=4A253502
- Number of (n+2) X (5+2) 0..1 arrays with every 2 X 2 and 3 X 3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=4A253507
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=40A253510