7486
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
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11880
- Proper Divisor Sum (Aliquot Sum)
- 4394
- 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
- 3528
- Möbius Function
- -1
- Radical
- 7486
- 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
- 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
- n written in fractional base 10/7.at n=46A024662
- Denominators of continued fraction convergents to sqrt(430).at n=9A041819
- Numbers whose base-3 representation has exactly 9 runs.at n=27A043589
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 9.at n=27A043806
- Numbers k such that number of runs in the base 3 representation of k is congruent to 9 mod 10.at n=27A043824
- Row 3 of square array defined in A047671.at n=15A047672
- a(n) = smallest k such that the digit sum of 8k is n.at n=38A077495
- a(n) = A104908(n) - 100*A104803(n).at n=20A104910
- Positive integers k such that 13^k == 9 (mod k).at n=15A116636
- a(n) = a(n-2) + a(n-4) + a(n-5) + a(n-7) + a(n-8) + a(n-10) for n >= 10, with a(0) = ... = a(9) = 1.at n=30A122762
- Number of subsets of {1,2,3,...,n} whose sum is prime.at n=14A127542
- A007318 * A084938.at n=38A134380
- Numbers of intervals for the pruning-grafting lattices of size n.at n=5A152093
- a(n) is the n-th J_12-prime (Josephus_12 prime).at n=8A163792
- First differences of A163891.at n=30A163893
- Numbers k such that k^2 + 1 = p*q, p and q primes and |p-q| is square.at n=23A187401
- Number of rhombuses on a (n+1)X7 grid.at n=40A190095
- Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,0,4,1,2 for x=0,1,2,3,4.at n=6A196144
- Number of nX7 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,0,4,1,2 for x=0,1,2,3,4.at n=5A196145
- Smallest m such that A070965(m) = n.at n=29A227953