15722
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 26976
- Proper Divisor Sum (Aliquot Sum)
- 11254
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6732
- Möbius Function
- -1
- Radical
- 15722
- 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
- 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(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=41A024847
- Starting from generation 7 add previous and next term yielding generation 8.at n=30A048454
- a(n) = n^2 + (n + 1)^3 + (n + 2)^4.at n=9A061222
- Smallest a(n)>2 such that all integers strictly between a(n)-n and a(n) are composite.at n=38A075741
- a(n) = n^3 + prime(n).at n=24A089620
- In binary representation: least number, k, which occurs n times in its factorial.at n=24A093826
- Triangle read by rows: coefficients of polynomials p(k) = (-x + k + 1)*p(k-1), starting p(0)=1, p(1)=1-x.at n=51A123319
- First string of 43 consecutive composite numbers.at n=38A177949
- Table of the elementary symmetric functions a_k(1,3,4,...,n+1).at n=48A196841
- a(n) = Sum_{i=0..n} digsum_7(i)^4, where digsum_7(i) = A053828(i).at n=20A231679
- a(n) = Sum_{i=0..n} digsum_8(i)^4, where digsum_8(i) = A053829(i).at n=20A231683
- Where record values occur in A276781, when starting from A276781(2)=1.at n=39A276782
- a(n) is the smallest integer k > n such that (k+1)(k+2)...(2k-2n+1)/(k(k-1)...(k-n+1)) is an integer.at n=38A290791
- Numbers n such that N = n^3 is a twin rank (A002822: 6N +- 1 are twin primes).at n=45A326234
- Number of compositions (ordered partitions) of n into distinct parts, the least being 7.at n=62A339170
- Lesser of 2 successive sphenic numbers (k, k+4) sandwiching 3 consecutive nonsquarefree numbers.at n=23A363830
- Array read by rows: T(m,n) is the number of m-digit semiprimes with last digit n, 0 <= n <= 9.at n=55A374940