5094
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 11076
- Proper Divisor Sum (Aliquot Sum)
- 5982
- 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
- 1692
- Möbius Function
- 0
- Radical
- 1698
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 33
- 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
- Coordination sequence T1 for Zeolite Code MOR.at n=46A008182
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 70.at n=15A031568
- Coefficients of iterated exponential function defined by y(x) = x^y(x) for e^-e < x < e^(1/e), expanded about x=1.at n=6A033917
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+5 or 24k-5. Also number of partitions in which no odd part is repeated, with at most 2 parts of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=44A036031
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique value such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.at n=31A050032
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 2.at n=31A050048
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 3.at n=31A050064
- Numbers k such that k^2 + prime(k) and k^2 - prime(k) are both primes.at n=30A064483
- Numbers k such that S(k+2) = d(k)+2, where S(k) is the Kempner function (A002034) and d(k) is the number of divisors of k (A000005).at n=28A073535
- Number of 6-ary Lyndon words of length n with trace 0 and subtrace 3 over Z_6.at n=7A074425
- Number of 6-ary Lyndon words of length n with trace 2 and subtrace 1 over Z_6.at n=7A074435
- Row sums of triangle in A077526.at n=7A077527
- a(n) = n * prime(prime(n)).at n=17A080697
- a(n) = (1/24) * (A018188(n)-11).at n=32A092153
- Number of 8k+5 primes (A007521) in range ]2^n,2^(n+1)].at n=17A095011
- Number of n-bit base-2 deletable primes.at n=18A096235
- Reduced numerators of the hypercube line-picking integrand sqrt(Pi)*I(n,0).at n=19A103990
- Number of partitions of n such that the largest part and the smallest part are relatively prime.at n=29A117087
- Row sums of A163334 and A163336.at n=17A163342
- Triangle interpolating the swinging factorial (A056040) restricted to even indices with its binomial inverse. Same as interpolating the central trinomial coefficients (A002426) with the central binomial coefficients (A000984).at n=41A163771