15109
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15660
- Proper Divisor Sum (Aliquot Sum)
- 551
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14560
- Möbius Function
- 1
- Radical
- 15109
- 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
- 133
- 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
- Hexanacci numbers: a(n+1) = a(n)+...+a(n-5) with a(0)=...=a(4)=0, a(5)=1.at n=20A001592
- a(n) = floor(n*phi^13), where phi is the golden ratio, A001622.at n=29A004928
- a(n) = round(n*phi^13), where phi is the golden ratio, A001622.at n=29A004948
- Numbers k such that k^2 contains only digits {1,2,8}.at n=7A053886
- Composite numbers not divisible by 5 which in base 5 contain their largest proper factor as a substring.at n=6A063889
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,2}.at n=30A079966
- Numbers whose natural logarithm, in base 10, starts with 10 distinct digits.at n=5A113509
- a(n) = 2*L(n) + L(n-1) - n, L(n) = n-th Lucas number A000204(n).at n=17A133641
- Members of A159053 which are not multiples of 3.at n=6A159054
- If an array is made of columns of -nacci sequences, fibo-, tribo- etc. all starting w. 1,1,2 etc, the NW to SE diagonals can be extended by computation. The above is diagonal 11. See A159741 for details.at n=4A159748
- Positive numbers y such that y^2 is of the form x^2+(x+521)^2 with integer x.at n=7A160583
- Half the number of n X 3 binary arrays with no 3 X 3 submatrix formed with any three rows and columns equal to J-I.at n=4A213413
- Half the number of nX5 binary arrays with no 3X3 submatrix formed with any three rows and columns equal to J-I.at n=2A213415
- T(n,k) = Half the number of n X k binary arrays with no 3 X 3 submatrix formed with any three rows and columns equal to J-I.at n=23A213418
- T(n,k) = Half the number of n X k binary arrays with no 3 X 3 submatrix formed with any three rows and columns equal to J-I.at n=25A213418
- n! mod n^3.at n=28A242427
- Positions of Fibonacci numbers in ordered sequence A160009 of all products of Fibonacci numbers.at n=47A272948
- First occurrence of run of lucky numbers congruent to 1 mod 4 of exactly length n.at n=6A330360
- Numbers that are the sum of nine fourth powers in ten or more ways.at n=21A345594
- Numbers that are the sum of nine fourth powers in exactly ten ways.at n=19A345852