15152
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 29388
- Proper Divisor Sum (Aliquot Sum)
- 14236
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7568
- Möbius Function
- 0
- Radical
- 1894
- Omega Function (Ω)
- 5
- 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
- 40
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th non-Fibonacci number).at n=17A023487
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 1) and d(n) = (n-th non-Lucas number).at n=18A023493
- Concatenate n-th prime and n-th composite.at n=35A038530
- a(n) = (((6^n mod 5^n) mod 4^n) mod 3^n) mod 2^n.at n=13A064855
- Solution to the non-squashing boxes problem (version 2).at n=30A089055
- Ramanujan numbers (A000594) read mod 16384.at n=9A126824
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 813", based on the 5-celled von Neumann neighborhood.at n=22A273640
- Numbers m such that psi(x) = phi(m) has a solution while sigma(y) = phi(m) has none.at n=15A291524
- Anagrexpo integers: integers N that exactly reproduce their set of digits when we form the set of exponentiation of pairs of adjacent digits, from left to right.at n=25A297627
- Partial sums of A033616.at n=31A299902
- Sum of the even parts in the partitions of n into 5 parts.at n=37A309547
- Triangle read by rows: Coefficients of the polynomials S2(n, x) * EZ(n, x), where S2 denote the Stirling set polynomials and EZ the Eulerian zig-zag polynomials A205497.at n=42A373428