4571
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5232
- Proper Divisor Sum (Aliquot Sum)
- 661
- 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
- 3912
- Möbius Function
- 1
- Radical
- 4571
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 59
- 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
- Number of bipartite partitions of n white objects and 6 black ones.at n=9A002755
- Number of bipartite partitions of n white objects and 9 black ones.at n=6A002758
- Number of n-covers of an unlabeled 5-set.at n=4A005771
- Number of 5-covers of an unlabeled n-set.at n=5A005785
- Coordination sequence T3 for Zeolite Code MFI.at n=43A008166
- Coordination sequence T4 for Zeolite Code MFI.at n=43A008167
- Number of partitions of 2*n into at most 4 parts.at n=41A014126
- Fibonacci sequence beginning 1, 19.at n=13A022109
- Triangle T(n,k) read by rows, giving number of k-member minimal covers of an unlabeled n-set, k=1..n.at n=49A055080
- The lexicographically earliest sequence of binary encodings of solutions satisfying the equation p_i = (1+mod(i,2))*p_{i-1} +- p_{i-2} +- p_{i-3} +- ... +- 2 + 1, where p_i is the i-th prime number.at n=12A059874
- Frobenius number of the numerical semigroup generated by three consecutive hexagonal numbers.at n=7A069758
- a(n) = Sum_{k=1..n} Sum_{d=1..k} (k mod d).at n=43A072481
- Least k such that decimal representation of k*n contains only digits 0 and 7.at n=16A096686
- Numbers k such that 9*10^k + 4*R_k - 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=4A103097
- Integers k such that 10^k + 33 is prime.at n=18A107084
- Numbers k such that A124837(k) is prime.at n=48A124881
- 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, 1, -1), (0, 0, -1), (0, 1, -1), (1, 0, 1)}.at n=8A149100
- 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, 0, 1), (0, 0, -1), (1, -1, 0), (1, 1, 1)}.at n=7A149675
- Sum of first n isolated (or single) primes A007510.at n=27A153478
- Composite numbers such that exactly nine distinct permutations of digits give primes.at n=36A163561