5397
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8256
- Proper Divisor Sum (Aliquot Sum)
- 2859
- 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
- 3072
- Möbius Function
- -1
- Radical
- 5397
- 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
- 116
- Smith Number
- yes
- 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
- For n >= 2, a(n) = b(n+1)+b(n)+b(n-1), where the b(i) are the ménage numbers A000179; a(0)=a(1)=1.at n=7A000270
- T(n, 2*n-3), T given by A027960.at n=29A027965
- Numbers whose base-2 representation has exactly 11 runs.at n=30A043578
- a(n) = (1/2)*(n-th number whose base-2 representation has exactly 12 runs).at n=33A043686
- Family 1 "Rule 90 x Rule 150 Array" read by antidiagonals.at n=23A048710
- 3rd row of Family 1 "90 x 150 array": generations 0 .. n of Rule 90 starting from seed pattern 21.at n=4A048713
- a(n) = Sum_{1<=k<=n, gcd(k,n)=1} 2^(k-1).at n=13A054432
- a(n) = (n^3 + 6n^2 - n + 12)/6.at n=30A074742
- a(n) = least odd number such that all pairwise sums a(i) + a(j), i < j <= n, are distinct.at n=40A080430
- Partial sums of A034953(n).at n=14A085739
- Indices of primes of the form k^2 - 11.at n=28A091273
- G.f.: (1+3*x^3)/((1-x)^2*(1-x^3)^2).at n=40A092352
- Base 10 numbers that are palindromic in bases 2 and 4.at n=35A097856
- a(n) is the least k such that k*(prime(n)#)^prime(n) - 1 is prime, where prime(n)# is the n-th primorial.at n=36A101047
- 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=27A124666
- Triangle read by rows: row n is the first row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (2,3,3,...) and super- and subdiagonals (1,1,1,...).at n=30A124733
- Numbers of the form 68+p^2 (where p is a prime).at n=20A138691
- Positions of partition numbers in the EKG sequence.at n=29A159032
- A positive integer is included if it is a palindrome when written in binary, and it is not divisible by any primes that are not binary palindromes.at n=49A163410
- Products of 3 distinct primes whose binary expansion is palindromic.at n=27A168355