15290
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
- 16
- Divisor Sum
- 30240
- Proper Divisor Sum (Aliquot Sum)
- 14950
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5520
- Möbius Function
- 1
- Radical
- 15290
- 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
- 32
- 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
- Least k such that 1+2+...+k >= E{1,2,...,n}, where E is the 4th elementary symmetric function.at n=18A027918
- Numbers whose base-4 representation contains exactly four 2's and three 3's.at n=28A045156
- Integers m such that the base-10 digit concatenation 2//m//3//m//5//m...//prime(49)//m//prime(50) is prime.at n=34A084048
- Matrix cube of triangle A105540 and, in this flattened form as read by rows, also equals column 2 of A105540.at n=56A105545
- a(0)=1, a(1)=2; for n>1, a(n)=3*a(n-1)+4*a(n-2)+5.at n=7A126019
- Minimal exponents m such that the fractional part of (11/10)^m obtains a maximum (when starting with m=1).at n=15A153687
- Numbers k such that the fractional part of (11/10)^k is greater than 1-(1/k).at n=7A153688
- Sum of all numbers from n to n-th prime.at n=40A161624
- Row sums of Fibonacci-Pascal triangle A162745.at n=9A162746
- The continued fraction expansion of tanh(Pi) requires the computation of the pairs (p_n, q_n); sequence gives values of q_n.at n=4A190352
- Partitions with parts repeated at most twice and repetition only allowed if first part has an odd index (first index = 1).at n=51A227134
- Number of partitions of n such that (least part) <= (multiplicity of greatest part).at n=36A240179
- First row of spectral array W(3^(1/3)).at n=16A249179
- Expansion of (4 + 15*x - 35*x^2 + 20*x^3 - 2*x^5)/(1 - x)^5.at n=16A257600
- a(n) = (n^4 + 20*n^3 + 125*n^2 + 250*n + 24)/12.at n=16A257601
- Number of nX3 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=7A302076
- T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 3 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=52A302081
- Larger of amicable pair m < n defined by t(n) = m and t(m) = n where t(n) = psi(n) - n and psi(n) = A001615(n) is the Dedekind psi function.at n=9A323330
- G.f. = Phi^5*F, where Phi = g.f. for A028930, F = g.f. for A028959.at n=13A328532