4589
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 4956
- Proper Divisor Sum (Aliquot Sum)
- 367
- 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
- 4224
- Möbius Function
- 1
- Radical
- 4589
- 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
- 59
- 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
- Numbers k such that k^4 can be written as a sum of four positive 4th powers.at n=27A003294
- Binomial transform of rooted tree numbers.at n=8A006930
- Numbers k such that the continued fraction for sqrt(k) has period 33.at n=13A020372
- T(n, 2*n-4), T given by A027960.at n=16A027966
- Numbers k such that in k and k^2 the parity of digits alternates.at n=28A030153
- Number of partitions of n with equal number of parts congruent to each of 0, 3 and 4 (mod 5).at n=45A035577
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 13.at n=13A051978
- Numbers k such that k^10 == 1 (mod 11^3).at n=33A056085
- a(n) gives smallest number requiring n iterations of the map i -> A053392(i) to reach zero.at n=27A060630
- Numbers n such that n and its reversal are both multiples of 13.at n=24A062903
- Non-palindromic number and its reversal are both multiples of 13.at n=13A062912
- Indices of primes of the form k^2 - 11.at n=25A091273
- Numbers k such that k^4 can be written as a sum of four distinct positive 4th powers.at n=27A096739
- Numbers k such that the first 9 decimal digits of the k-th Fibonacci number is 1-9 pandigital.at n=1A112516
- a(n) = ceiling(a(n-1)^(4/3) + a(n-2)^(4/3)), with a(0) = a(1) = 1.at n=8A114957
- Numbers k such that k and 8*k, taken together, are zeroless pandigital.at n=1A115932
- a(n) = n^3 - (n+1)^2.at n=17A153257
- Sides of squares which are filled exactly (no holes, no overlaps) by the digits needed to write a subsequence of consecutive Fibonacci numbers, starting with 0.at n=13A158027
- Locations of records in A177930.at n=52A177931
- a(n) = 4*n^2 - n - 1.at n=34A185950