4559
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
- 4704
- Proper Divisor Sum (Aliquot Sum)
- 145
- 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
- 4416
- Möbius Function
- 1
- Radical
- 4559
- 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
- 152
- 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
- Coordination sequence T1 for Zeolite Code STI.at n=46A008234
- Number of binary [ n,8 ] codes of dimension <= 8 without zero columns.at n=10A034342
- Variation of Boustrophedon transform applied to 1,1,1,1,... Fill an array by diagonals, all in the 'up' direction. The first column is 1,1,1,1,.... For the next element of a diagonal, add to the previous element the elements of the row and the column the new element is in. The first row gives a(n).at n=6A059578
- The array of A059578 read by antidiagonals in the 'up' direction.at n=27A059579
- Numbers k such that k*2^m-1 is prime for exactly one exponent m in the range 0<=m<=k.at n=46A061157
- Numbers k such that d(k) + d(k+1) + d(k+2) = 8, where d(k) = A001223.at n=25A064026
- Prefixing, suffixing or inserting a 9 in the number anywhere gives a prime.at n=25A069833
- Smallest argument m such that commutator[phi(m), gpf(m)] = 2n-1, where phi(m) = A000010(m) and gpf(m) = A006530(m), the largest prime factor of m.at n=36A070818
- a(n) = A000094(n+4) - A006918(n).at n=26A084835
- a(0) = 2, a(n) is the smallest squarefree number > a(n-1) such that the sum a(n) + a(i) for all i = 1 to (n-1) is squarefree. Or, sum of any two terms is a squarefree number.at n=48A085902
- T(n,m) equals number of solid partitions of n containing m plane partitions.at n=67A094504
- a(1) = 1 then the least multiple of odd numbers not odd multiples of 5, (3,7,9,11,13,17,19,21,23,27,29,...) such that every partial concatenation is noncomposite.at n=18A110433
- Smallest semiprimes such that a(j) - a(k) are all different.at n=45A135257
- Partial sums of A003325.at n=24A139211
- a(n) = the smallest multiple of the n-th prime such that (a(n)-1) is divisible by both the (n-1)th prime and the (n+1)st prime.at n=13A143244
- a(n) = (1 + 3*n)*(4 + 3*n)/2.at n=31A145910
- 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, 0), (-1, 0, -1), (0, -1, 1), (1, 1, -1), (1, 1, 1)}.at n=7A149622
- a(n) = 8*n^2 + 14*n + 5.at n=23A181890
- a(n) = (5*n^2 - 3*n + 2)/2.at n=43A192136
- Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,3,1,0,4 for x=0,1,2,3,4.at n=6A196741