5385
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8640
- Proper Divisor Sum (Aliquot Sum)
- 3255
- 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
- 2864
- Möbius Function
- -1
- Radical
- 5385
- 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
- 147
- Smith Number
- no
- 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
- Numbers k such that (2^(2k+1) - 2^(k+1) + 1)/5 is prime.at n=15A006596
- Coordination sequence T3 for Zeolite Code VNI.at n=45A009909
- Number of (unordered) triples of integers from [1,n] with no common factors between pairs.at n=47A015617
- a(n)/1000 gives sqrt(n) to 3 places after the decimal point.at n=28A027662
- Numbers having period-1 7-digitized sequences.at n=31A031201
- Expansion of (1-x)/(1-x-x^3-x^4+x^5).at n=24A052532
- Number of partitions of n in SPM(n): these are the partitions obtained from (n) by iteration of the following transformation: p -> p' if p' is a partition (i.e., decreasing) and p' is obtained from p by removing a unit from the i-th component of p and adding one to the (i+1)-th component, for any i.at n=40A056219
- Numbers k such that k and its reversal are both multiples of 15.at n=32A062905
- Non-palindromic number and its reversal are both multiples of 15.at n=27A062914
- Numbers n not of the form i^2+(i+1)^2 such that there are integers a < b with a^2+(a+1)^2+...+(n-1)^2 = n^2+(n+1)^2+...+b^2.at n=15A094523
- A Chebyshev transform of A090400 related to the knot 8_2.at n=11A099845
- Numbers n such that 3*10^n-7 is prime.at n=10A102964
- Numbers k such that phi(k) + prime(k) is a triangular number.at n=24A115908
- Square of Riordan array (1, x*c(x)) where c(x) is the g.f. of A000108.at n=38A127631
- Numbers k such that k and k^2 use only the digits 2, 3, 5, 8 and 9.at n=7A137086
- Numbers of the form 56+p^2 (where p is a prime).at n=20A138690
- Triangle of 4-Eulerian numbers.at n=19A144698
- Numbers of the form p*q*r, where p < q < r are odd primes such that r = +/-1 (mod p*q).at n=29A160353
- Integers of the form (k+1)*(2k+1)/12.at n=29A164578
- A symmetrical triangular sequence:t(n,m)=(StirlingS1[n, m] + StirlingS1[n, n - m])*Binomial[n, m] - (StirlingS1[n, 0] + StirlingS1[n, n - 0])* Binomial[n, 0] + 1.at n=23A174834