5098
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 7650
- Proper Divisor Sum (Aliquot Sum)
- 2552
- 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
- 2548
- Möbius Function
- 1
- Radical
- 5098
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 59
- Smith Number
- yes
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Number of 3-valent trees (= boron trees or binary trees) with n nodes.at n=17A000672
- a(n) = (5*n + 1)^2 + 4*n + 1.at n=14A007533
- a(0) = 1, a(n) = 26*n^2 + 2 for n>0.at n=14A010016
- Numbers k such that the continued fraction for sqrt(k) has period 3.at n=19A013643
- Expansion of 1/((1-x)(1-2x)(1-9x)(1-11x)).at n=3A021294
- Numbers k such that 159*2^k + 1 is prime.at n=26A032456
- Growth function of an infinite cubic graph (number of nodes at distance <=n from fixed node).at n=22A038621
- Base-7 palindromes that start with 2.at n=22A043016
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.at n=12A049957
- Number of 3-valent trees (= boron trees or binary trees) with n nodes.at n=35A052120
- Numbers k such that for any positive integers (a, b), if a * b = k then a + b is prime.at n=55A080715
- q such that p^4 + q^4 = r^4 + s^4 = a(n).at n=27A088665
- a(n) = (1/24) * (A018188(n)-11).at n=33A092153
- Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n and height k (can be easily expressed using RNA secondary structure terminology).at n=61A098076
- Sum of the numbers of unitary divisors of the binomial coefficients C(n,k), k=0..n.at n=36A103445
- Triangle read by rows, where t(n,1) = 1, t(n,m) = t(n,m-1) + (largest noncomposite {1 or prime} in row {n-1}).at n=39A120852
- Prime(n)^2*prime(n+1)...*prime(a(n)) is the least product of consecutive primes which is abundant. Note that only the first term is squared.at n=46A126105
- Number of unrooted bifurcating tree shapes with n leaves.at n=17A129860
- Triangle read by rows: T(n,k) = number of labeled graphs on n nodes with k connected components, 1<=k<=n.at n=16A143543
- Number of numbers removed in each step of Eratosthenes's sieve for 10^6.at n=10A145539