4315
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5184
- Proper Divisor Sum (Aliquot Sum)
- 869
- 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
- 3448
- Möbius Function
- 1
- Radical
- 4315
- 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
- 126
- 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 T3 for Zeolite Code EPI.at n=41A008092
- Coordination sequence T1 for Zeolite Code MTT.at n=40A008189
- Coordination sequence T5 for Zeolite Code TER.at n=44A016437
- Expansion of 1/((1-3x)(1-4x)(1-6x)(1-10x)).at n=3A028035
- Expansion of Product_{m>=1} ((1+q^(2*m-1))/(1+q^(2*m)))^5.at n=21A029842
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 13.at n=34A031511
- Conjecturally, a power of 2 written in base 3 cannot have this many 0's.at n=36A036462
- Numbers having three 3's in base 8.at n=28A043435
- 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) = 3, and a(3) = 1.at n=41A050057
- Numbers n for which the first difference sequence of A054040 decreases.at n=43A082915
- Row sums of triangle A089940.at n=11A089941
- Numbers n such that n, n+2, n+4, n+6 are semiprimes.at n=39A092126
- Partial sums of A000960.at n=24A099074
- Partial sums of A101351.at n=11A101352
- Triangular matrix, read by rows, where row n is formed from the first differences of row (n-1) of its inverse matrix square, with an appended '1' for the main diagonal.at n=17A102583
- Table read by antidiagonals: B(n,m) is the numerator of the Bernoulli polynomial of order m and degree n evaluated at x=0.at n=71A126853
- 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), (0, 1, 0), (1, 0, 0), (1, 1, -1), (1, 1, 1)}.at n=6A151153
- 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, 0), (1, 0, 0), (1, 1, 1)}.at n=6A151171
- a(n) = 2*n^2 + 10*n + 3.at n=44A152813
- 2-comma numbers: n occurs in the sequence S[k+1] = S[k] + 10*last_digit(S[k-1]) + first_digit(S[k]) for two different splittings n=concat(S[0],S[1]).at n=24A166512