15047
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15456
- Proper Divisor Sum (Aliquot Sum)
- 409
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14640
- Möbius Function
- 1
- Radical
- 15047
- 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
- 45
- 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
- Number of n-node unlabeled connected graphs with one cycle of length 3.at n=11A000226
- a(n) = n*(9*n-2).at n=41A013656
- Composite numbers generated by the Euler polynomial x^2 + x + 41.at n=19A145292
- Prime-generating polynomial: a(n) = 16*n^2 - 300*n + 1447.at n=40A181973
- a(n) is the sum of all distinct integers that can be produced by reversing the digits of n in any base b >= 2.at n=53A211518
- Semiprimes generated by the Euler polynomial x^2 + x + 41.at n=19A228183
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 646", based on the 5-celled von Neumann neighborhood.at n=42A273328
- Number of pairs (a,b) such that a*b = n! and d(a) = d(b) with d = A000005 and a <= b.at n=37A277621
- Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + 3, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=39A294871
- Number of unlabeled series-reduced rooted trees with n nodes where the non-leaf branches directly under any given node are all equal.at n=22A320268
- Main diagonal of A332367, divided by 4.at n=23A332368
- Number of compositions (ordered partitions) of n into distinct parts >= 7.at n=59A339108
- a(n) = n * Sum_{d|n} sigma(d)^2 / d.at n=39A344042
- The positive odd numbers x such that x = c^2 - y and +-x = a +- y, where (a,b,c) is a primitive Pythagorean triple (PPT), a is odd and y is an even positive integer.at n=26A357535