15479
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 26
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 16176
- Proper Divisor Sum (Aliquot Sum)
- 697
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14784
- Möbius Function
- 1
- Radical
- 15479
- 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
- 146
- 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
- Expansion of Product_{m>=1} (1 + x^m)^23.at n=4A022588
- Iccanobirt prime indices (7 of 15): Indices of prime numbers in A102117.at n=12A102137
- Expansion of 1/(1 - x^3 - x^4 - x^5 + x^8)^2.at n=34A147851
- 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, 0, 0), (-1, 1, 1), (0, -1, 1), (1, 0, -1), (1, 1, 0)}.at n=8A149454
- Numerator of Euler(n, 1/25).at n=3A156964
- a(n) = 12*n^2 - 2*n - 1.at n=36A185918
- Column 3 of array in A226513.at n=22A226514
- Least positive integer m such that m + n divides prime(m)^2 + prime(n)^2.at n=2A247975
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 57", based on the 5-celled von Neumann neighborhood.at n=26A285606
- a(n) is the greatest integer k such that k/Fibonacci(n) < sqrt(2).at n=21A293418
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) + n, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.at n=15A294416
- Number of n X 4 0..1 arrays with every element equal to 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=10A298926