7498
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11808
- Proper Divisor Sum (Aliquot Sum)
- 4310
- 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
- 3564
- Möbius Function
- -1
- Radical
- 7498
- 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
- 176
- 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
- Expansion of a modular function for Gamma_0(6).at n=13A002508
- Partition function coefficients for square lattice spin 2 Ising model.at n=45A010108
- Numbers k such that the continued fraction for sqrt(k) has period 62.at n=32A020401
- Numbers k such that 19*2^k+1 is prime.at n=9A032359
- Numbers whose base-3 representation has exactly 9 runs.at n=28A043589
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 9.at n=28A043806
- Numbers k such that number of runs in the base 3 representation of k is congruent to 9 mod 10.at n=28A043824
- a(n)*10^n are the denominators of the greedy alternating Egyptian fraction expansion of Pi - 3 of the form Sum_{n>=0} (-1)^n / (a(n)*10^n).at n=2A052385
- Number of numbers k which give 1 after applying exactly n iterations of the 3k+1 algorithm (if a number is even, divide it by 2; if it is odd, multiply by 3 and add 1). This total includes numbers k which also give 1 for a smaller number of iterations (i.e., for this sequence we do not assume the algorithm halts when 1 is reached).at n=37A082538
- 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=45A085248
- Numbers k such that k + sigma(k) is a triangular number.at n=34A115904
- Numbers k such that (k!-5)/5 is prime.at n=16A139200
- a(n) = 441*n + 1.at n=16A158322
- a(n) = n^3/6 + 3*n^2/4 + 7*n/3 + 7/8 + (-1)^n/8.at n=34A173154
- Companion value m associated with A177967(n).at n=26A177968
- Array T(m,n) = greatest k such that 1/n + ... + 1/(n+k-1) <= m, by rising antidiagonals.at n=47A214966
- Numbers n for which number of iterations to reach the largest equals number of iterations to reach 1 from the largest in Collatz (3x+1) trajectory of n.at n=18A224303
- Number of (n+2) X 5 0..1 matrices with each 3 X 3 subblock idempotent.at n=13A224554
- Number of length n+3 0..2 arrays with at most one downstep in every 3 consecutive neighbor pairs.at n=5A255102
- T(n,k)=Number of length n+k 0..2 arrays with at most one downstep in every k consecutive neighbor pairs.at n=33A255107