5012
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 10080
- Proper Divisor Sum (Aliquot Sum)
- 5068
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2136
- Möbius Function
- 0
- Radical
- 2506
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 134
- 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
- Expansion of 1/(1-x^7-x^8-x^9-x^10-x^11-x^12-x^13).at n=53A017862
- Base 3 digital convolution sequence.at n=21A033640
- Number of branched catafusenes with n condensed hexagons.at n=9A036359
- Starting from generation 5 add previous and next term yielding generation 6.at n=36A048452
- Triangle T(n,k) of numbers of minimal 4-covers of an unlabeled n+4-set that cover k points of that set uniquely (k=4,..,n+4).at n=49A057967
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 67 ).at n=27A063340
- Sum_{k=1..n} floor(n*(n-1)/(2*k)).at n=48A069627
- Difference between the product of numbers up to n and the sum of numbers up to n.at n=6A076128
- a(n) is the least number m such that the minimal exponent for which reverse(m^n) = prime holds is n. Thus reverse(m^k) is composite for k = 1, .., n-1.at n=48A085325
- Ooguri-Vafa invariants of disk degeneracies for brane III in the O(K) -> P^1 x P^1 geometry.at n=5A092708
- Number of permutations of 1..n with no five elements in correct or reverse order.at n=7A095818
- Numbers n whose abundance is 56.at n=41A101260
- Number of partitions of 2n free of multiples of 5. All odd parts occur with multiplicity 2 or 4. the even parts occur at most twice.at n=29A103257
- Least positive k such that k * [RSA-2048]^n + 1 is prime, where RSA-2048 is the 617 decimal digit RSA challenge number A391940(54).at n=2A108881
- Self-describing sequence. See the sequence as a succession of digits: then a(n) is the position of a composite digit in the sequence.at n=48A114318
- a(n) = 2 + floor((1 + Sum_{j=1..n-1} a(j))/3).at n=27A120149
- Smallest number whose tenth power has at least n digits.at n=37A130084
- a(1)=2. For n >=2, a(n) = p(n) *(floor(a(n-1)/p(n)) +2), where p(n) is the n-th prime.at n=40A138621
- Sum (number of cycles)^2 over all n! permutations of [1..n].at n=5A151881
- Triangle T(n, k) = 2 + n! - k! - (n-k)!, read by rows.at n=31A156045