15283
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 1997
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13440
- Möbius Function
- -1
- Radical
- 15283
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 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
- no
- Odd
- yes
Appears in sequences
- Numerator of 2^n*(3*n-3)!/( ((n-1)!)^3 * (2*n)! ).at n=12A004677
- a(n) = 3 + floor((2 + Sum_{j=1..n-1} a(j))/4).at n=38A120162
- Numbers that can be formed using its own digits in order and only addition and fourth power operators.at n=21A195672
- Composite squarefree numbers n such that p(i)-5 divides n+5, where p(i) are the prime factors of n.at n=12A225705
- Numbers n such that the sum of the numbers in the Collatz (3x+1) iteration of n is a perfect square.at n=36A225866
- Numbers k such that (5*10^k - 101)/3 is prime.at n=19A282506
- Number of triples (p,q,r) of partitions such that p is a partition of n and r <= q <= p (by diagram containment).at n=10A305023
- a(n) = Sum_{k=1..n} binomial(n-1,k-1)*prime(k)*n!/k!.at n=5A317421
- G.f. A(x) satisfies: A(x) = Sum_{n>=0} x^n * (1+x)^(n^2) / A(x)^(n*(n+1)/2).at n=13A321099
- a(n) = Sum_{k=1..n} (k * floor(n/k))^3.at n=11A356249
- Number of integer partitions of n whose first differences have mean -1.at n=53A361392
- Sphenic numbers k such that floor(log(k)/log(lpf(k))) = 1+floor(log(k)/log(p)) for all primes p | k such that p > lpf(k), where lpf = A020639(k).at n=33A383177