4775
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
- 6
- Divisor Sum
- 5952
- Proper Divisor Sum (Aliquot Sum)
- 1177
- 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
- 3800
- Möbius Function
- 0
- Radical
- 955
- Omega Function (Ω)
- 3
- 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
- no
- Squarefree Number
- no
- 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
- Smallest k such that the product of q/(q-1) over the primes from prime(n) to prime(n+k-1) is greater than 2.at n=45A001276
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 19 (most significant digit on left).at n=39A029464
- Numbers k such that k-1 is a palindrome in base 10, and k+1 is a palindrome in base 17.at n=20A033621
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2.at n=42A050045
- Numbers n such that Catalan(n)-1 is prime.at n=31A053427
- Positions where number of periodic partitions increases.at n=31A059994
- Group the positive integers as (1, 2), (3, 4, 5), (6, 7, 8, 9, 10), (11, 12, 13, 14, 15, 16, 17), ... the n-th group containing prime(n) elements. Except the first, all groups contain an odd number of elements and hence have a middle term. Sequence gives the middle terms starting from group 2.at n=47A073612
- a(1) = 1, then multiply, add and subtract 2, 3, 4; 5, 6, 7; ... in that order.at n=14A077382
- Antidiagonal sums of table A083047.at n=12A083049
- a(n) = (2*n - 1)*a(n - 1) + 2^n for n >= 1, a(0) = 1.at n=5A128196
- Array read by antidiagonals. A scheme of arrangements: ArrScheme(k,n) = VarScheme(k,n-1) + k^n; ArrScheme(k,0) = 1. VarScheme(k,n) = (n*k+1)*(VarScheme(k,n-1) + k^n); VarScheme(k,0) = 1.at n=33A128198
- Indices of squares (of primes) in the semiprimes.at n=32A128301
- Indices k such that A020509(k)=Phi[k](-10) is prime, where Phi is a cyclotomic polynomial.at n=47A138920
- Triangle of 3-Eulerian numbers.at n=23A144697
- Integers of the form k*(k+9)/8.at n=46A165719
- a(n) = (11*n^2 + 11*n - 20)/2.at n=28A166144
- a(n) = 5*n^2 - n + 1.at n=31A172043
- Smallest a(n) such that the prime factorization of a(n)! contains at least one factor to each exponent between 1 and n.at n=31A177442
- Numbers n such that n''' = n''+ 1 where n'' and n''' are respectively the second and the third arithmetic derivative of n.at n=6A189941
- a(n) = (5*n^2 - 3*n + 2)/2.at n=44A192136