5615
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
- 6744
- Proper Divisor Sum (Aliquot Sum)
- 1129
- 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
- 4488
- Möbius Function
- 1
- Radical
- 5615
- 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
- 67
- 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
- Expansion of 1 / ((1-x)^2*(1-x^2)*(1-x^3)*(1-x^4)).at n=37A002621
- a(n) = n*(5*n^2 - 2)/3.at n=15A004466
- Numbers k such that 197*2^k+1 is prime.at n=10A032475
- a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1).at n=20A037165
- Expansion of (1-x)^(-1)/(1-2*x-2*x^2+2*x^3).at n=9A077847
- Numbers k such that 7^k + 5^k - 1 is prime.at n=13A101234
- Numbers n such that p(7n) is prime, where p(n) is the number of partitions of n.at n=17A114167
- Riordan array (1/sqrt(1-4*x), (1/sqrt(1-4*x)-1)/2).at n=40A116395
- Triangle read by rows: T(n,k) is the number of ternary words of length n on {0,1,2} having sum of the lengths of the drops equal to k (n>=0, k>=0). The drops of a ternary word on {0,1,2} are the subwords 10,20 and 21, their lengths being the differences 1, 2 and 1, respectively.at n=56A120907
- a(1)=a(2)=1. a(n+1) = a(n) + a(largest prime dividing n).at n=33A128215
- 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, 0, -1), (0, 1, 0), (1, 0, 1)}.at n=7A150247
- a(n) = 144*n - 1.at n=38A158136
- a(n) = 225*n^2 - 2*n.at n=4A158226
- Sums of prime points found in four grids in each corner of a square.at n=29A161190
- Numbers k such that 30*k and 60*k are both the average of twin prime pairs.at n=35A177679
- Number of 2 X 2 nonsingular 0..n matrices with a(1,1) <= a(1,2) <= a(2,1) <= a(2,2).at n=16A183763
- Numbers k such that 10^k - sigma(k^2) is prime.at n=6A193881
- Sequence of coefficients of x in marked mesh pattern generating function Q_{n,132}^(0,0,4,0)(x).at n=5A212341
- Numbers n such that Q(sqrt(n)) has class number 10.at n=28A218042
- Maximum fixed points under iteration of sum of cubes of digits in base n.at n=19A226026