5389
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5724
- Proper Divisor Sum (Aliquot Sum)
- 335
- 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
- 5056
- Möbius Function
- 1
- Radical
- 5389
- 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
- 67
- 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) = floor( n*(n-1)*(n-2)/11 ).at n=40A011893
- Numbers k such that the continued fraction for sqrt(k) has period 45.at n=15A020384
- Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026648.at n=17A026658
- a(n) = Sum_{k=floor((n+1)/2)..n} T(k,n-k); i.e., a(n) is the n-th diagonal sum of left-justified array T given by A026998.at n=20A027010
- Palindromes in factorial base.at n=47A046807
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 13.at n=15A051978
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 61 ).at n=35A063334
- Semiprimes p1*p2 such that p2 > p1 and p2 mod p1 = 11.at n=19A064909
- Reflective numbers: k such that the decimal encoding of the prime factorization of k (A067599) is palindromic.at n=35A066985
- a(1) = 1; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=42A074336
- Partial sums of A035282.at n=38A078472
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={0}.at n=13A080012
- A 2nd order recursion: a(1)=a(2)=1, a(n) = prime(a(n-2)) + pi(a(n-1)) = A000040(a(n-2)) + A000720(a(n-1)).at n=13A082095
- Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1 <= k <= m positions can be picked in an m X m square array such that their adjacency graph consists of a single component. Two positions (s,t), (u,v) are considered as adjacent if max(abs(s-u), abs(t-v)) <= 1.at n=39A098485
- Start with 1 and repeatedly reverse the digits and add 64 to get the next term.at n=33A118159
- Smaller of two consecutive semiprimes with the same digital root.at n=32A118699
- a(n) = a(n-1)+ [least square > a(n-1)].at n=10A166068
- Least odd number d such that the Collatz (3x+1) iteration of d has the following property: if the length of the iteration is b and the maximum value occurs at c, the ratio c/b is 1/n.at n=33A224994
- Number of union-closed partitions of weight n.at n=35A225973
- Smaller of two consecutive semiprimes which are anagrams of each other.at n=4A228135