5415
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 9144
- Proper Divisor Sum (Aliquot Sum)
- 3729
- 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
- 2736
- Möbius Function
- 0
- Radical
- 285
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 41
- 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
- Number of irreducible positions of size n in Montreal solitaire.at n=9A007075
- Coordination sequence T4 for Zeolite Code NES.at n=47A008208
- Integer part of ((4th elementary symmetric function of 1,2,...,n)/(1+2+...+n)).at n=10A024171
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3).at n=34A024312
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 19 (most significant digit on left).at n=40A029464
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 2 (mod 4).at n=41A035547
- Conjecturally, a power of 2 written in base 3 cannot have this many 2's.at n=39A036463
- Number of partitions of n such that cn(0,5) = cn(2,5) < cn(1,5) < cn(3,5) = cn(4,5).at n=76A036860
- Numbers k that divide 8^k + 7^k.at n=44A045604
- Distinct odd numbers in the numerators of the 1/3-Pascal triangle (by row).at n=46A046557
- Distinct odd numbers in writing first numerator and then denominator of each element to the right of the central elements of the 1/3-Pascal triangle (by row).at n=47A046561
- a(n) is the number of solutions to x+y+z = 0 mod 3, where 1 <= x < y < z <= n.at n=47A061866
- Numbers k such that k and its reversal are both multiples of 15.at n=34A062905
- Non-palindromic number and its reversal are both multiples of 15.at n=29A062914
- a(n) = 15*n^2.at n=19A064761
- Numbers n such that sum of digits of n equals the squarefree part of n.at n=38A070274
- Harshad numbers which terminate in their digital sum.at n=32A070938
- a(n) = least k such that 2ik + 1 is prime for all 1 <= i <= n.at n=4A071576
- 2-apexes of omega: numbers k such that omega(k-2) < omega(k-1) < omega(k) > omega(k+1) > omega(k+2), where omega(m) = the number of distinct prime factors of m.at n=25A076762
- Numbers n such that when the digits of Fibonacci(n) are sorted into decreasing order and zeros are dropped it is a prime.at n=40A082922