5133
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7200
- Proper Divisor Sum (Aliquot Sum)
- 2067
- 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
- 3248
- Möbius Function
- -1
- Radical
- 5133
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 54
- 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
- Witt vector *4!/4!.at n=2A006179
- A thinks of x in set M; B asks questions: is x in T?; A may lie once but only when true answer is Yes; a(n) is maximal size of M such that B can determine x with <= n questions.at n=14A010033
- a(n) = a(n-1) + a(n-2) + 1, with a(0) = 0 and a(1) = 12.at n=14A022317
- Number of Lyndon words (aperiodic necklaces) with 4n beads of 4 colors, n beads of each color. One color labeled, the other 3 unlabeled.at n=2A029809
- Coefficients in 1/(1+P(x)), where P(x) is the generating function of the primes.at n=24A030018
- Least possible integer k/(product of digits k) for k with n digits.at n=17A034685
- a(n)-th prime is the smallest prime containing exactly n 9's.at n=4A037070
- Number of primes less than 10000n.at n=4A038813
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049735.at n=16A049738
- a(n) is the first of a triple of consecutive integers, each of which is the product of three distinct primes.at n=5A066509
- Odd numbers k such that (10^k - 1)/3 - 2*10^floor(k/2) is a palindromic wing prime (a.k.a. near-repdigit palindromic prime) of the form 3...313...3.at n=13A077775
- Numbers n such that there are no primes < 2n in the sequence m(0)=n, m(k+1)=m(k)+4k.at n=17A099468
- a(n) = Sum_{i=1..n} (n-i+1)*phi(i).at n=36A103116
- a = a(n) is such that the a-th prime p(a) is the least prime with digital sum equal to n, or a(n)=0 if no such prime exists.at n=39A104290
- Start with 1 and repeatedly reverse the digits and add 61 to get the next term.at n=35A118156
- Juxtapose the number of prime divisors of n, n+1, n+2 and n+3 (counted with multiplicity) from n=2.at n=40A122052
- Number of indecomposable partitions of n.at n=29A122697
- Numbers n whose reverse binary representation has the following property: let a 0 mean "halving" and a 1 mean "k -> 3k+1". The number describes an operation k -> f_n(k). If the equation f_n(k) = k has an integer solution, n is a term in the sequence.at n=38A125754
- Numbers n whose reverse binary representation has the following property: let a 0 mean "halving" and a 1 mean "k -> 3k+1". The number describes an operation k -> f_n(k). If the equation f_n(k) = k has a positive integer solution, n is a term in the sequence.at n=24A125756
- Numbers n such that primorial(n)/2 + 8 is prime.at n=21A139441