3447
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 4992
- Proper Divisor Sum (Aliquot Sum)
- 1545
- 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
- 2292
- Möbius Function
- 0
- Radical
- 1149
- 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
- 56
- 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
- no
- Odd
- yes
Appears in sequences
- Number of connected permutations of [1..n] (those not fixing [1..j] for 0 < j < n). Also called indecomposable permutations, or irreducible permutations.at n=7A003319
- Sum of the first n primes.at n=42A007504
- A015938(n)-2^n.at n=34A015939
- Expansion of 1/(1-x^4-x^5-x^6-x^7-x^8).at n=35A017830
- a(1) = 3; a(n+1) = a(n)-th nonprime, where nonprimes begin at 0.at n=28A025000
- Numbers k such that 51*2^k+1 is prime.at n=26A032375
- a(1) = 1; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=34A033680
- Composite numbers whose prime factors contain no digits other than 3 and 8.at n=11A036317
- Nearest integer to n^(5/2).at n=26A036488
- Numerators of continued fraction convergents to sqrt(397).at n=4A041754
- Numbers k such that the string 6,5 occurs in the base 9 representation of k but not of k-1.at n=46A044310
- Numbers n such that string 4,7 occurs in the base 10 representation of n but not of n-1.at n=37A044379
- Numbers n such that string 4,7 occurs in the base 10 representation of n but not of n+1.at n=37A044760
- Numbers whose base-4 representation contains exactly three 1's and three 3's.at n=11A045127
- Numbers of the form p*q*r where p,q,r are (not necessarily distinct) odd palindromic primes (odd terms from A002385).at n=39A046373
- Array T(n,k) = number of subgroups of index k in free group of rank n, read by antidiagonals.at n=26A049290
- Composite numbers arising as sum of first k primes.at n=35A053790
- Triangle T(n,k) (1 <= k <= n) read by rows: T(n,k) is the number of permutations of [1..n] with k components.at n=21A059438
- a(1) = 0; a(n) = smallest composite number which is a sum of n distinct primes.at n=41A073619
- a(1) = 3; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=27A074339