5358
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
- 16
- Divisor Sum
- 11520
- Proper Divisor Sum (Aliquot Sum)
- 6162
- 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
- 1656
- Möbius Function
- 1
- Radical
- 5358
- Omega Function (Ω)
- 4
- 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
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = round(1000*log_2(n)).at n=40A004266
- a(n) = ceiling(1000*log_2(n)).at n=40A004267
- Number of ordered quadruples of integers from [ 2,n ] with no global factor.at n=17A015638
- Numbers having period-1 7-digitized sequences.at n=30A031201
- Least term in period of continued fraction for sqrt(n) is 5.at n=24A031429
- Even numbers seen in decimal expansion of Pi (disregarding the decimal period) contiguous, smallest and distinct.at n=3A050818
- a(n) = 3*(n - 2)*(5*n -11).at n=19A060785
- Number of n-digit cubes (0 is included as a single-digit number).at n=11A062941
- Numbers k such that k^4 + 1, (k+2)^4 + 1 and (k+4)^4 + 1 are all primes.at n=5A073476
- Non-balanced numbers in A015769.at n=41A077803
- Numbers k such that 6^k - 5^(k-1) is prime.at n=29A093713
- Number of 8k+-3 primes (A003629) in range [2^n,2^(n+1)].at n=16A095014
- Numbers n for which there are exactly five k such that n = k + (product of nonzero digits of k).at n=14A096926
- Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k weak ascents (1 <= k <= ceiling(n/2)).at n=43A114690
- a(n) = prime(n)_n.at n=50A122637
- a(n) = (n^3)/2 + (3*n^2)/2 + 3*n + 3.at n=20A127873
- Number of inversions in all Fibonacci binary words of length n.at n=12A129707
- Values of n such that Pi^n starts with the digits n.at n=4A131493
- Let P(A) be the power set of an n-element set A. Then a(n) = the number of pairs of elements {x,y} of P(A) for which either 0) x and y are disjoint and for which either x is a subset of y or y is a subset of x, or 1) x and y are intersecting but for which x is not a subset of y and y is not a subset of x, or 2) x = y.at n=7A134045
- a(n) = (prime(n)^2 + prime(n+1))/2.at n=25A140511