7598
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11880
- Proper Divisor Sum (Aliquot Sum)
- 4282
- 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
- 3640
- Möbius Function
- -1
- Radical
- 7598
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 70
- 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
- Partial sums of cubes of Lucas numbers.at n=5A005971
- a(n) = min_{k=1..n} (a(k-1) + 2^k*(n + a(n-k))); a(0) = 0.at n=11A006696
- Step at which n is expelled in Kimberling's puzzle (A035486).at n=26A006852
- If a, b in sequence, so is ab+10.at n=36A009368
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite BEA = Beta Na7[Al7Si57O128] starting with a T3 atom.at n=12A019069
- Least term in period of continued fraction for sqrt(n) is 6.at n=36A031430
- a(n) is the index of the first occurrence of n in A080071, or 0 for those n>0 which never occur in A080071.at n=13A080090
- 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=46A085248
- Least k such that 10^n + k - 1 is the first of a pair of twin primes.at n=33A103129
- Euler transform of 1, 5, 9, 13, 17, 21, 25, 29, 33, ... (A016813).at n=9A137806
- a(n) = 9*n^2 + n.at n=28A154517
- a(n) = 841*n^2 + 29.at n=3A158665
- Left edge of the triangle in A033291.at n=28A192735
- Numbers n for which A222085(n)=A222085(n+1).at n=13A222088
- Strictly superdiagonal compositions: compositions (p1, p2, p3, ...) of n such that pi > i.at n=35A238874
- Second smallest multiple of n whose digits sum to n.at n=28A245065
- a(1)=1, a(n+1) is the smallest number m such that A244448(a(n)) < A244448(m).at n=6A246628
- Natural numbers n that have the property that starting from k = n, the fixed point of the map k -> floor(tan(k)) is strictly positive, while the smallest number encountered during the iteration is strictly negative.at n=47A258202
- Number of partitions of n with product of multiplicities of parts equal to 8.at n=48A266691
- Numbers k such that 4^k-3^(k+1) is prime.at n=16A272272