5459
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5616
- Proper Divisor Sum (Aliquot Sum)
- 157
- 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
- 5304
- Möbius Function
- 1
- Radical
- 5459
- 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
- 160
- 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
- a(n) = round(1000*log_2(n)).at n=43A004266
- Numerators of the expansion of -W_{-1}(-e^(-1 - x^2/2)) where x > 0 and W_{-1} is the Lambert W function.at n=14A005447
- Numerators of worst case for Engel expansion.at n=31A006539
- a(n) = prime(n)*(prime(n+1)-1)/2.at n=26A014303
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly nine 1's.at n=15A020445
- Sequence satisfies T(a)=a, where T is defined below.at n=50A027597
- a(n) = (2*n+1) * (4*n-1).at n=26A033566
- a(1) = 7; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=42A046257
- Composite n such that sigma(n)-phi(n) divides sigma(n)+phi(n).at n=43A061367
- Smallest solution m to (n+1)*phi(m) = n*sigma(m), or -1 if no solution exists.at n=16A065824
- a(n) = A065824(A047845(n+1)).at n=6A065884
- Nonprime numbers n such that q=phi(n)/(sigma(n)-n-1) is an integer and n is not a prime square.at n=36A070161
- Number of anisohedral polyiamonds with n cells.at n=26A075224
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,1,3}.at n=41A079957
- Composite numbers k such that the continued fraction for k/m contains no 2 for any 1 <= m <= k.at n=20A082409
- Highly cototient numbers: records for a(n) in A063741.at n=43A100827
- Numbers n such that googol - n is prime.at n=17A108251
- Positive integers i for which A112049(i) == 7.at n=10A112067
- Start with 1015 and repeatedly reverse the digits and add 4 to get the next term.at n=22A117807
- Numbers ending in 1, 3, 7 or 9 such that either prepending or following them by one digit doesn't produce a prime.at n=28A124666