7968
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 21168
- Proper Divisor Sum (Aliquot Sum)
- 13200
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2624
- Möbius Function
- 0
- Radical
- 498
- Omega Function (Ω)
- 7
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 52
- 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
- Minimal number of people to give a 50% probability of having at least n coincident birthdays in one year.at n=36A014088
- Number of subsets of { 1, ..., n } containing an A.P. of length 10.at n=20A018795
- Number of ordered factorizations indexed by prime signatures: A074206(A025487).at n=51A050324
- 18-gonal (or octadecagonal) numbers: a(n) = n*(8*n-7).at n=32A051870
- Least m such that phi(x)=2m has exactly n solutions.at n=39A085758
- Triangle: number of exactly (m-1)-dimensional partitions of n, for n >= 1, m >= 0.at n=70A119271
- Number of parts > 1 in the last section of the set of partitions of n.at n=30A138135
- a(n) = Frobenius number for 3 successive primes = F[p(n), p(n+1), p(n+2)].at n=39A138989
- Second differences of Mersenne primes A000668.at n=2A139232
- Shifts left when Dirichlet convolution with a (DC:(b,a)->c) applied twice.at n=9A144817
- Square array A(n,k), n>=1, k>=1, read by antidiagonals, with A(1,k)=1 and sequence a_k of column k shifts left when Dirichlet convolution with a_k (DC:(b,a_k)->a) applied k times.at n=64A144823
- Lower triangular array, called S1hat(-4), related to partition number array A145369.at n=48A145370
- 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), (0, 0, -1), (1, 0, 1), (1, 1, -1)}.at n=8A149333
- Values of n such that n^a-+a are primes, a=5.at n=8A155021
- Multiplicative order of 2 in Z/mZ with m=A104017(n).at n=39A165139
- The number of 4321-avoiding separable permutations of length n.at n=9A165521
- Number of parts in all partitions of 2n+1 that do not contain 1 as a part.at n=15A182735
- a(n) = 14*n^2 - 4*n.at n=24A195023
- T(n,k) gives the number of permutations of the set [n] that contain k occurrences of the subword (132); irregular array read by rows (n >= 0 and 0 <= k <= max(0, floor((n-1)/2))).at n=30A197365
- Numbers which, when divided by the sum of their prime factors, give a prime number.at n=34A199013