4595
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
- 5520
- Proper Divisor Sum (Aliquot Sum)
- 925
- 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
- 3672
- Möbius Function
- 1
- Radical
- 4595
- 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
- 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.at n=10A002765
- Coordination sequence T12 for Zeolite Code MFI.at n=43A008164
- Expansion of g.f. 1/((1-6*x)*(1-8*x)*(1-9*x)).at n=3A020579
- T(2n,n), array T as in A047030.at n=6A047039
- 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, a(2) = 2, and a(3) = 1.at n=48A050041
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 20.at n=34A051985
- a(1) = 2; a(n) = 9*2^(n-2) - n - 2, n>1.at n=10A054127
- Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives i values.at n=16A054234
- Terms in decimal expansion of 1/(17*2^n) before 5882352941176470 (the period with no leading zeros of 1/17) appears.at n=6A067615
- Numbers k such that 6*k! + 1 is prime.at n=27A076682
- Values of n for which the decimal number 10...030...01 is an n-digit prime.at n=15A100028
- Numbers n such that n^2-6 and n^2+6 are both prime.at n=20A108403
- {Sum of all k-digit numbers > n }-{sum of all k-digit numbers < n}, n is a 'k'digit number.at n=19A109644
- a(1)=a(2)=1; thereafter, a(n+1) = a(n) + a(n-1) + 1 if n is a multiple of 5, otherwise a(n+1) = a(n) + a(n-1).at n=18A124502
- Number of base 21 n-digit numbers with adjacent digits differing by one or less.at n=6A126375
- a(n) = Sum_{k=1..phi(n)} k*t(k), where t(k) is the k-th positive integer which is coprime to n and phi(n) is the number of positive integers which are <= n and are coprime to n.at n=32A135324
- a(n) = Frobenius number for 3 successive primes = F[p(n), p(n+1), p(n+2)].at n=31A138989
- 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, 1, -1), (1, -1, 0), (1, 1, 1)}.at n=7A149616
- Numbers k with the property that the average digit of k^2 is 2.at n=29A164770
- a(n) is the starting position of the n-th occurrence of n in the string 123456789101112131415161718192021... .at n=41A181362