15146
domain: N
Properties
Digital Properties
- Digit Count
- 5
- 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
- 22722
- Proper Divisor Sum (Aliquot Sum)
- 7576
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7572
- Möbius Function
- 1
- Radical
- 15146
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 40
- 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
- yes
- Odd
- no
Appears in sequences
- Weighted count of partitions with distinct parts.at n=37A005895
- Numbers k such that the continued fraction for sqrt(k) has period 37.at n=36A020376
- Number of partitions satisfying (cn(0,5) <= cn(2,5) = cn(3,5) and cn(2,5) <= cn(1,5) and cn(2,5) <= cn(4,5)).at n=54A036816
- Expansion of -(3 - x + 2*x^2) / (1 - x^3 + x^4).at n=58A110063
- a(n) = 15 + floor((2 + Sum_{j=1..n-1} a(j))/3).at n=24A120159
- Numbers n such that partition number p(n) == 14 (mod n).at n=9A121015
- Let S(1) = {1} and, for n>1 let S(n) be the smallest set containing x, 2x and x+2 for each element x in S(n-1). a(n) is the number of elements in S(n).at n=19A122554
- a(n) = prime(n)^2 - prime(n^2). Commutator of (primes, squares) at n.at n=38A123914
- Number of 1-sided strip polytans with n cells.at n=10A151520
- Least m>0 such that prime(n) divides S(m)=A007908(m)=123...m and all numbers obtained by cyclic permutations of its digits; 0 if no such m exists.at n=29A181373
- Number of nondecreasing arrangements of n numbers x(i) in -(n+2)..(n+2) with the sum of sign(x(i))*2^|x(i)| zero.at n=8A187983
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 4,4,3,0,1,0,0 for x=0,1,2,3,4,5,6.at n=5A197754
- Number of unitary polyominoes without holes with n cells. A unitary polyomino is a polyomino whose edges all have length 1.at n=33A245660
- a(n) = n + 2*cos((n*Pi)/3) + Lucas(n).at n=19A297661
- Number of chordless cycles in the n-web graph.at n=17A297665
- a(n) = Sum_{k=0..n} phi(k^2 + 1), where phi is the Euler totient function (A000010).at n=40A333170
- (A331763(n) - A331755(n+1))/2.at n=27A335687
- Number of ways to write n as an ordered sum of 5 nonprime numbers.at n=45A341482