2969
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 2970
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 2968
- Möbius Function
- -1
- Radical
- 2969
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 428
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes p == 3, 9, 11 (mod 20) such that 2p+1 is also prime.at n=39A000355
- Primes of the form k^2 - k - 1.at n=30A002327
- Primes p == 1 (mod 8), p = a^2 + 64*b^2 such that y^2 = x^3 + p*x has rank 2.at n=36A007766
- Coordination sequence T1 for Zeolite Code LOV.at n=36A008134
- Numerator of [x^(2n+1)] in the Taylor series arccos(cot(x)*arcsinh(x)).at n=4A012869
- Twelve iterations of Reverse and Add are needed to reach a palindrome.at n=10A015993
- Numbers k such that the continued fraction for sqrt(k) has period 47.at n=3A020386
- Let q_k=p(p+2) be product of k-th pair of twin primes; sequence gives values of p such that (q_k)^2 > q_{k-i}q_{k+i} for all 1 <= i <= k-1.at n=26A021005
- Fibonacci sequence beginning 1, 20.at n=12A022110
- Primes that remain prime through 2 iterations of function f(x) = 8x + 9.at n=26A023264
- Primes that remain prime through 2 iterations of function f(x) = 9x + 2.at n=43A023265
- Primes that remain prime through 3 iterations of function f(x) = 9x + 2.at n=15A023296
- a(n) = position of the n-th n in A026400.at n=50A026403
- Primes that are palindromic in base 5.at n=23A029973
- a(n) = prime(10*n - 2).at n=42A031384
- Numbers whose set of base-7 digits is {1,4}.at n=36A032819
- Numbers whose set of base-14 digits is {1,2}.at n=16A032934
- Primes of form x^2+35*y^2.at n=29A033224
- Primes of form x^2+53*y^2.at n=31A033234
- Primes of form x^2+59*y^2.at n=20A033238