4543
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5760
- Proper Divisor Sum (Aliquot Sum)
- 1217
- 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
- 3480
- Möbius Function
- -1
- Radical
- 4543
- 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
- 183
- 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
- Numbers k such that 11*2^k + 1 is prime.at n=13A002261
- "Pascal sweep" for k=7: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=53A009504
- Orders of cyclotomic polynomials containing a coefficient the absolute value of which is >= 4.at n=31A013592
- Composites n such that A001414(n) is odd and divides n.at n=38A036346
- Odd composite numbers divisible by the sum of their prime factors (counted with multiplicity).at n=16A046347
- Composite numbers divisible by the palindromic sum of their prime factors (counted with multiplicity).at n=13A046358
- Odd numbers divisible by the palindromic sum of their prime factors (counted with multiplicity).at n=3A046359
- Distinct numbers in writing first numerator and then denominator of each element of the 1/4-Pascal triangle (by row).at n=41A046570
- First denominator and then numerator of the elements to the right of the central elements of the 1/4-Pascal triangle (by row), excluding 1's.at n=67A046577
- First denominator and then numerator of the elements to the right of the central elements of the 1/4-Pascal triangle (by row), excluding 1's and 4's.at n=44A046578
- Numerators of the elements to the right of the central elements of the 1/4-Pascal triangle (by row).at n=50A046580
- Distinct odd numbers in the numerators of the 1/4-Pascal triangle (by row).at n=34A046586
- Distinct numbers in writing first numerator and then denominator of each element to the right of the central elements of the 1/4-Pascal triangle (by row).at n=39A046588
- Numerators of the elements to the right of the central elements of the 1/4-Pascal triangle (by row), excluding 1's.at n=37A046590
- Number of cubic residues mod 3^n.at n=9A046631
- Expansion of (1+3*x+9*x^2+12*x^3+11*x^4+3*x^5+x^6)/((1-x)^2*(1-x^2)^2*(1-x^3)).at n=12A055383
- Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 9 (most significant digit on right).at n=5A061938
- Primitive subsequence of A066031: terms of A066031 which are not a multiple of some previous terms.at n=36A064623
- a(1)=a(2)=1, a(n)=a(n-1)+a(n-2) if n is odd, a(n)=a(n-1)+a(n/2) if n is even.at n=22A078912
- Multiples of 11 in which the even positioned digits from left are odd and the odd positioned ones are even.at n=32A080467