5390
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 12312
- Proper Divisor Sum (Aliquot Sum)
- 6922
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1680
- Möbius Function
- 0
- Radical
- 770
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 28
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- 5 X 5 stochastic matrices of integers.at n=2A005466
- Coordination sequence for 4-dimensional I-centered cubic orthogonal lattice.at n=11A008532
- sech(arcsinh(x)*exp(x))=1-1/2!*x^2-6/3!*x^3-15/4!*x^4+60/5!*x^5...at n=7A012595
- Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite MER = Merlinoite K5Ca2[ Al9Si23O64 ] . 24 H2O.at n=5A019042
- a(n) = n*(27*n - 1)/2.at n=20A022284
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = (primes).at n=17A025111
- Sequence satisfies T(a)=a, where T is defined below.at n=48A027592
- Expansion of 1/((1-3x)(1-5x)(1-7x)(1-10x)).at n=3A028061
- a(n) = (2*n+1)*(9*n+1).at n=17A033573
- Number of partitions of n into parts not of the form 17k, 17k+7 or 17k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=31A035968
- Numerators of continued fraction convergents to sqrt(492).at n=6A041938
- Numbers whose base-5 representation contains exactly two 0's and three 3's.at n=14A045198
- Number of inequivalent ways to color faces of a cube using at most n colors.at n=7A047780
- 11-gonal (or hendecagonal) numbers: a(n) = n*(9*n-7)/2.at n=35A051682
- Path-counting array T; each step of a path is (1 right) or (1 up) to a point below line y=x, else (1 right and 1 up) or (1 up) to a point on the line y=x, else (1 left) or (1 up) to a point above line y=x. T(i,j)=number of paths to point (i-j,j), for 1<=j<=i, i >= 1.at n=52A055450
- a(n) = T(n,n-2), array T as in A055450.at n=7A055452
- a(n) = (2*n-1)*(n^2 -n +2)/2.at n=17A063488
- Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188).at n=2A064114
- Number of unconstrained walks on square lattice trapped after n steps.at n=11A078528
- Sum of first n 6-almost primes.at n=16A086052