4537
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4900
- Proper Divisor Sum (Aliquot Sum)
- 363
- 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
- 4176
- Möbius Function
- 1
- Radical
- 4537
- 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
- 64
- 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
- Centered 12-gonal numbers, or centered dodecagonal numbers: numbers of the form 6*k*(k-1) + 1.at n=27A003154
- Number of factorization patterns of polynomials of degree n over F_3.at n=18A006168
- Pseudoprimes to base 24.at n=23A020152
- Strong pseudoprimes to base 24.at n=7A020250
- Numbers k such that the continued fraction for sqrt(k) has period 41.at n=10A020380
- Fibonacci sequence beginning 4, 17.at n=13A022134
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023531, t = (Lucas numbers).at n=17A024319
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (Lucas numbers).at n=16A024882
- Numerators of continued fraction convergents to sqrt(458).at n=3A041872
- Denominators of continued fraction convergents to sqrt(745).at n=8A042435
- Numbers whose base-5 representation contains exactly three 1's and three 2's.at n=4A045232
- a(n)=T(n,1), array T as in A049735.at n=38A049744
- Numbers n such that n^2 contains exactly 8 different digits.at n=14A054036
- Central column of arrays in A057027 and A057028.at n=47A057029
- a(1) = 1; a(n) = sum of terms in the continued fraction for the square of the continued fraction [a(1); a(2), a(3), a(4),..., a(n-1)].at n=28A061143
- Collatz-2 (A063041) trajectory starting at 29.at n=6A063044
- Collatz-2 (A063041) trajectory starting at 29.at n=36A063044
- Collatz-2 (A063041) trajectory starting at 29.at n=21A063044
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 11.at n=14A064909
- Denominator of (prime(n)+1)*(prime(n+1)+1)/(4*(prime(n)*prime(n+1)+1)).at n=37A079082