15910
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
- 16
- Divisor Sum
- 30096
- Proper Divisor Sum (Aliquot Sum)
- 14186
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6048
- Möbius Function
- 1
- Radical
- 15910
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- no
- 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
- a(1) = 0, a(2) = 0; for n > 2, a(n) - a(n-3) - a(n-5) - ... - a(n-p) = n if n is prime, otherwise = 0, where p = largest prime < n.at n=36A002123
- a(n) = (1/24)*(n+1)*(3*n^3+59*n^2+358*n+648).at n=15A090949
- Structured disdyakis triacontahedral numbers (vertex structure 11).at n=9A100158
- Decimal Goedelization of antitheorems from propositional calculus, in Richard C. Schroeppel's metatheory of A101273.at n=15A100200
- Integers n such that 10^n-59 is prime.at n=19A108506
- Number of 5-almost primes 5ap such that 2^n < 5ap <= 2^(n+1).at n=17A120036
- Sequence that except for initial 1 is the complement of its inverse binomial transform.at n=11A120539
- Number of line segments connecting exactly 4 points in an n x n grid of points.at n=25A177720
- Palindromic in bases 7 and 29.at n=22A249158
- Expansion of Product_{k>=1} (1 + x^(k^2))^(k^2).at n=53A291649
- a(n) = a(n-1) + a(n-3) + 2*a(n-5) - a(n-8) - a(n-10), n > 10.at n=19A293344
- Numbers k for which rank of the elliptic curve y^2=x^3+k*x is 4.at n=10A309031
- Let f(1) = 1 + i (where i denotes the imaginary unit) and for n > 0, f(n+1) is the Gaussian prime in the first quadrant (with positive real part and nonnegative imaginary part) with least modulus that divides 1 + Product_{k=1..n} f(k) (in case of a tie minimize the imaginary part); a(n) is the imaginary part of f(n).at n=7A320104
- a(n) is the number of ways to express 2*n+1 as a sum of parts x such that x+2 is an odd prime.at n=41A333615