2967
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 4224
- Proper Divisor Sum (Aliquot Sum)
- 1257
- 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
- 1848
- Möbius Function
- -1
- Radical
- 2967
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 141
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Simple triangulations of a disk: column 4 of square array in A210664.at n=6A004305
- Coordination sequence T4 for Zeolite Code NON.at n=33A008215
- Integers that are squarefree and also the sum of first k squarefrees for some k.at n=36A013932
- Odd numbers k such that phi(k) | sigma_3(k).at n=43A015809
- a(1) = 3; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=27A025000
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = (primes).at n=15A025111
- Numbers k such that 51*2^k+1 is prime.at n=25A032375
- Number of binary [ n,3 ] codes.at n=16A034357
- Composites n such that A001414(n) is odd and divides n.at n=25A036346
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(1,5) <= cn(3,5) = cn(4,5).at n=65A036856
- Coordination sequence Z12 for Zeolite Code STT.at n=36A038416
- Numbers k such that the string 5,6 occurs in the base 9 representation of k but not of k-1.at n=40A044302
- Numbers n such that string 6,7 occurs in the base 10 representation of n but not of n-1.at n=32A044399
- Numbers n such that string 6,7 occurs in the base 10 representation of n but not of n+1.at n=32A044780
- Odd composite numbers divisible by the sum of their prime factors (counted with multiplicity).at n=11A046347
- n plus a googol is prime.at n=8A049014
- Composite numbers k such that k!/k# - 1 is prime, where k# = primorial numbers A034386.at n=20A049421
- Numbers that are unchanged when turned upside down, when written in a font in which 7 looks like upside-down 2.at n=40A051791
- Numbers k such that 30*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=9A056680
- The array described in A059513 read by antidiagonals in the 'up' direction.at n=25A059574