4498
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7308
- Proper Divisor Sum (Aliquot Sum)
- 2810
- 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
- 2064
- Möbius Function
- -1
- Radical
- 4498
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 46
- 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
- Coordination sequence for sigma-CrFe, Position Xf.at n=17A009958
- Numbers k such that the continued fraction for sqrt(k) has period 15.at n=22A020354
- Fibonacci sequence beginning 2, 30.at n=12A022377
- Expansion of Product_{m>=1} (1-m*q^m)^26.at n=7A022686
- Position of numbers of form 3*n^2 in A025060 (numbers of form j*k + k*i + i*j, where 1 <=i < j < k).at n=35A025064
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 5.at n=25A031418
- Numbers n such that n and its reversal are both multiples of 13.at n=23A062903
- Non-palindromic number and its reversal are both multiples of 13.at n=12A062912
- Left truncatable 3-almost primes, in which repeatedly deleting the leftmost digit gives a 3-almost prime at every step until a single-digit 3-almost prime remains.at n=34A085248
- Number of prime pairs below 10^n having a difference of 38.at n=6A093973
- Number of distinct values of i*j + j*k + k*i with 1 <= i < j <= k <= n.at n=46A102533
- Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0) = 1, T(n,k) = 0 if n<k, T(n,0) = T(n-1,0) + T(n-1,1) and for k >= 1: T(n,k) = T(n-1,k-1) + x*T(n-1,k) + T(n-1,k+1) with x = 3.at n=40A110877
- Expansion of (1/(1-x))*sum(k>=2,x^k/(1-2x^k)).at n=23A113240
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 5 multiples of n-1, n-2, ..., 1, for n>=1.at n=44A113742
- Generalized Mancala solitaire (A002491); to get n-th term, start with n and successively round up to next 9 multiples of n-1, n-2, ..., 1, for n>=1.at n=32A113746
- Positive numbers such that the digital sum base 2 and the digital sum base 10 are in a ratio of 2:10.at n=42A135110
- E.g.f. exp(Sum_{d|M} (exp(d*x)-1)/d), M=13.at n=4A141009
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (-1, 1, -1), (0, -1, 0), (1, 1, 0)}.at n=8A149117
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2*k+1 if k <= floor(n/2) otherwise 2*(n-k)+1, and m = 2, read by rows.at n=18A157273
- Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2*k+1 if k <= floor(n/2) otherwise 2*(n-k)+1, and m = 2, read by rows.at n=17A157273