4670
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8424
- Proper Divisor Sum (Aliquot Sum)
- 3754
- 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
- 1864
- Möbius Function
- -1
- Radical
- 4670
- 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
- 90
- 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
- Coordination sequence T1 for Zeolite Code VNI.at n=42A009907
- Number of fullerenes with 2n vertices (or carbon atoms), counting enantiomorphic pairs as distinct.at n=21A057210
- a(n+1) = a(n)-th composite number, with a(1) = 11.at n=25A059407
- Number of prime graphs on n vertices. (G is prime iff G has no module. Modules are also called homogeneous sets.)at n=7A079473
- a(1) = 1; for n > 1, a(n) is the least k > a(n-1) such that a(n) + a(n-1) is square and a(n) - a(n-1) is prime.at n=16A108972
- Number of partitions of n into parts relatively prime to 63 and not == 2 (mod 4).at n=45A119952
- Egyptian fraction representation for the cube root of 75.at n=2A132549
- Position of the n-th Catalan number in the EKG sequence.at n=9A140510
- Tribonacci left-bounded rhombic triangle.at n=46A161009
- a(n) is the sum of the smallest parts of all partitions of n that do not contain 1 as a part.at n=32A182708
- Potential magic constants of 8 X 8 magic squares composed of consecutive primes.at n=9A189188
- Expansion of g.f. A(x) satisfying A(x) = x + A(A(x))^2 - A(A(x))^3.at n=6A190761
- Vertex number of a square spiral in which the length of the first two edges are the legs of the primitive Pythagorean triple [15, 8, 17]. The edges of the spiral have length A195035.at n=39A195036
- Number of unimodular 2 X 2 matrices having all terms in {0,1,...,n}.at n=43A210000
- Number of nondecreasing sequences of n 1..5 integers with every element dividing the sequence sum.at n=41A212533
- Number of (w,x,y) with all terms in {0,...,n} and w>=range{w,x,y}.at n=19A212968
- Related to Pisano periods: numbers n such that there are n+10 distinct Fibonacci numbers mod n.at n=14A229467
- Number of (n+1)X(2+1) 0..1 arrays with the difference of the upper and lower median value of each 2X2 subblock in lexicographically nondecreasing order rowwise and columnwise.at n=3A235567
- Number of (n+1)X(4+1) 0..1 arrays with the difference of the upper and lower median value of each 2X2 subblock in lexicographically nondecreasing order rowwise and columnwise.at n=1A235569
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the difference of the upper and lower median value of each 2X2 subblock in lexicographically nondecreasing order rowwise and columnwise.at n=11A235573