3047
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3336
- Proper Divisor Sum (Aliquot Sum)
- 289
- 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
- 2760
- Möbius Function
- 1
- Radical
- 3047
- Omega Function (Ω)
- 2
- 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
- 61
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Number of n-node rooted trees of height at most 3.at n=15A001383
- Numbers that are the sum of 9 positive 6th powers.at n=36A003365
- Coordination sequence T9 for Zeolite Code EUO.at n=34A008104
- Coordination sequence T6 for Zeolite Code MFI.at n=35A008169
- Coordination sequence T4 for Zeolite Code MTT.at n=34A008192
- Coordination sequence T1 for Zeolite Code VET.at n=34A009902
- Expansion of 1/((1-2*x)*(1-7*x)*(1-10*x)).at n=3A016313
- Coordination sequence T7 for Zeolite Code TER.at n=37A016439
- Sequence A025513 divided by 2.at n=11A025514
- Least term in period of continued fraction for sqrt(n) is 5.at n=15A031429
- Numbers k such that 197*2^k+1 is prime.at n=9A032475
- Number of partitions in parts not of the form 25k, 25k+1 or 25k-1. Also number of partitions with no part of size 1 and differences between parts at distance 11 are greater than 1.at n=35A036000
- Denominators of continued fraction convergents to sqrt(526).at n=8A042007
- Numbers n such that string 5,5 occurs in the base 9 representation of n but not of n-1.at n=37A044301
- Numbers n such that string 4,7 occurs in the base 10 representation of n but not of n-1.at n=33A044379
- Numbers n such that string 5,5 occurs in the base 9 representation of n but not of n+1.at n=37A044682
- Numbers n such that string 4,7 occurs in the base 10 representation of n but not of n+1.at n=33A044760
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049687.at n=30A049688
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 4.at n=11A049976
- Starting positions of strings of 2 5's in the decimal expansion of Pi.at n=31A050238