7467
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 10560
- Proper Divisor Sum (Aliquot Sum)
- 3093
- 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
- 4680
- Möbius Function
- -1
- Radical
- 7467
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 85.at n=21A031583
- Number of bracelets (turnover necklaces) of n beads of 2 colors, 5 of them black.at n=34A032279
- Numbers whose base-3 representation has exactly 9 runs.at n=18A043589
- Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 8.at n=34A043799
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 9.at n=18A043806
- Numbers k such that number of runs in the base 3 representation of k is congruent to 9 mod 10.at n=18A043824
- a(1) = 4; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=39A074341
- Numbers n such that zero is never reached by iterating the mapping k -> abs(reverse(lpd(k))-reverse(gpf(k))). lpd(k) is the largest proper divisor and gpf(k) is the largest prime factor of k.at n=20A076425
- Minimal k > n such that (4k+3n)(4n+3k) is a square.at n=18A083752
- Sum of the first n pairs of consecutive primes (for example, a(3) = (2+3) + (3+5) + (5+7) = 25).at n=42A102724
- Next term is the sum of previous term and the square of the sum of its decimal digits, with a(0) = 10.at n=26A112787
- Antidiagonal sums of the Wythoff array A035513.at n=13A160997
- Majority value maps: number of nX3 binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal, vertical and antidiagonal neighbors in a random 0..1 nX3 array.at n=4A220305
- Majority value maps: number of nX5 binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal, vertical and antidiagonal neighbors in a random 0..1 nX5 array.at n=2A220307
- T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal, vertical and antidiagonal neighbors in a random 0..1 nXk array.at n=23A220308
- T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal, vertical and antidiagonal neighbors in a random 0..1 nXk array.at n=25A220308
- G.f. satisfies: A(x) = Sum_{n>=0} x^n * (A(x) + x^n)^n.at n=9A248603
- Somos's sequence {b(9,n)} defined in comment in A078495: a(0)=a(1)=...=a(20)=1; for n>=21, a(n)=(a(n-1)*a(n-20)+a(n-10)*a(n-11))/a(n-21).at n=46A272038
- Numbers m such that for any positive integers (x, y), if x * y = m where x <= y, then x^2 + 2*y^2 is a prime number.at n=43A287930
- Number of partitions of n in which the sequence of the sum of the same summands is increasing.at n=44A304428