4337
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4338
- 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
- 4336
- Möbius Function
- -1
- Radical
- 4337
- 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
- 46
- 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
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 592
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Number of Twopins positions.at n=18A005687
- a(0) = 1, a(n) = 15*n^2 + 2 for n>0.at n=17A010005
- Expansion of e.g.f. sec(tan(sin(x))), even powers only.at n=4A012148
- Number of trivalent connected simple graphs with 2n nodes and girth at least 8.at n=21A014376
- Twelve iterations of Reverse and Add are needed to reach a palindrome.at n=25A015993
- Numbers k such that the continued fraction for sqrt(k) has period 47.at n=8A020386
- Primes p whose digits do not appear in p^2.at n=46A030086
- Numbers k such that 65*2^k+1 is prime.at n=30A032382
- Decimal concatenation of n-th lucky number and n-th prime number.at n=11A032604
- Conjecturally, a power of 2 written in base 3 cannot have this many 2's.at n=30A036463
- Numbers n such that 169*2^n-1 is prime.at n=16A050836
- Primes q of form q=10p+7, where p is also prime.at n=21A055783
- Primes p with the following property: let d_1, d_2, ... be the distinct digits occurring in the decimal expansion of p. Then for each d_i, dropping all the digits d_i from p produces a prime number. Leading 0's are not allowed.at n=29A057876
- Primes with 3 distinct digits that remain prime (no leading zeros allowed) after deleting all occurrences of any one of its distinct digits.at n=20A057879
- Smallest prime p such that p^n reversed is a prime.at n=48A059706
- Numbers which need 12 'Reverse and Add' steps to reach a palindrome.at n=25A065217
- Solutions k of the equation phi(k) = phi(k-1) + phi(k-2). Also known as Phibonacci numbers.at n=19A065557
- Primes which are the sum of a prime number of consecutive primes in a prime number of different ways.at n=43A066366
- Smallest prime equal to n^2 + m^2 with n<m.at n=43A068487
- Primes > 1000 in which every substring of length 3 is also prime.at n=30A069489