7435
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 8928
- Proper Divisor Sum (Aliquot Sum)
- 1493
- 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
- 5944
- Möbius Function
- 1
- Radical
- 7435
- 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
- 44
- Smith Number
- no
- 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
- no
- Odd
- yes
Appears in sequences
- [ exp(7/18)*n! ].at n=6A030881
- Lucky numbers with size of gaps equal to 16 (upper terms).at n=22A031899
- Numbers having four 1's in base 9.at n=17A043460
- Numbers whose base-3 representation has exactly 9 runs.at n=12A043589
- Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 8.at n=28A043799
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 9.at n=12A043806
- Numbers k such that number of runs in the base 3 representation of k is congruent to 9 mod 10.at n=12A043824
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/5 of the elements are <= n/3.at n=16A047198
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/5 of the elements are <= (n-1)/3.at n=16A048010
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/5 of the elements are <= (n-2)/3.at n=16A048021
- Fibocyclotomic numbers: numbers formed from cyclotomic polynomials and Fibonacci numbers (A000045).at n=25A051258
- Every 25th Fibocyclotomic number.at n=0A051259
- Cubic star numbers: a(n) = n^3 + 4*Sum_{i=0..n-1} i^2.at n=15A051673
- Cyclotomic polynomials Phi_n at x=phi divided by sqrt(5) and floored down (where phi = tau = (sqrt(5)+1)/2).at n=25A063704
- Cyclotomic polynomials Phi_n at x=phi, divided by sqrt(5) and rounded to nearest integer (where phi = tau = (sqrt(5)+1)/2).at n=25A063706
- Connell (5,3)-sum sequence (partial sums of the (5,3)-Connell sequence).at n=57A122795
- a(1)=a(2)=1; thereafter, a(n+1) = a(n) + a(n-1) + 1 if n is a multiple of 5, otherwise a(n+1) = a(n) + a(n-1).at n=19A124502
- a(n) = Sum_{i=0..n} Fibonacci(5*i).at n=4A138134
- a(n) = 338*n - 1.at n=21A157999
- a(n) = 676*n - 1.at n=10A158393