7466
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11202
- Proper Divisor Sum (Aliquot Sum)
- 3736
- 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
- 3732
- Möbius Function
- 1
- Radical
- 7466
- 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
- 88
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 31.at n=29A020370
- Let (u1,u2) be successive untouchable numbers such that phi(u1) = phi(u2); sequence gives values of u1.at n=21A048189
- Numbers n such that 287*2^n-1 is prime.at n=18A050902
- Partial sums of A001157: Sum_{j=1..n} sigma_2(j).at n=25A064602
- a(n) = floor((4/3)^n).at n=31A064628
- Values of floor((4/3)^n) that are composite.at n=20A070761
- Positions of 9 in partition of decimal expansion of Pi A104807.at n=23A104809
- Number of partitions of n such that number of odd parts is greater than or equal to number of even parts.at n=33A130780
- Numbers k such that k and k^2 use only the digits 1, 4, 5, 6 and 7.at n=7A137046
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (0, 0, 1), (1, -1, 0), (1, 1, -1)}.at n=9A148359
- n^2 + {1,3,7} are primes.at n=24A182238
- a(n) = a(n-1)*2 + floor(sqrt(a(n-2))).at n=13A182557
- Number of n X 1 0..3 arrays with no occurrence of three equal elements in a row horizontally, vertically, diagonally or antidiagonally, and new values 0..3 introduced in row major order.at n=8A204678
- T(n,k)=Number of nXk 0..3 arrays with no occurrence of three equal elements in a row horizontally, vertically, diagonally or antidiagonally, and new values 0..3 introduced in row major order.at n=36A204685
- T(n,k)=Number of nXk 0..3 arrays with no occurrence of three equal elements in a row horizontally, vertically or nw-to-se diagonally, and new values 0..3 introduced in row major order.at n=36A205161
- T(n,k)=Number of nXk 0..3 arrays with no occurrence of three equal elements in a row horizontally or vertically, and new values 0..3 introduced in row major order.at n=36A205310
- Minimum even value unattainable as the sum of 6 attained values of i*(i-1) with i in 0..n.at n=37A225292
- Numbers k such that p = k^2 + 1 is prime, as are p-6 and p+6.at n=35A227178
- Numbers k such that m^2 + k^2/m^2 is prime for every m|k.at n=42A236423
- T(n,k)=Number of nXk 0..3 arrays with no element equal to exactly two horizontal and vertical neighbors, with new values 0..3 introduced in row major order.at n=36A240629