15702
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 31416
- Proper Divisor Sum (Aliquot Sum)
- 15714
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 5232
- Möbius Function
- -1
- Radical
- 15702
- 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
- 84
- 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
- Number of permutations s of {1,2,...,n} such that |s(i)-i|>1 for each i=1,2,...,n.at n=9A001883
- Smallest number at distance n from nearest prime.at n=19A051652
- Smallest number at distance 2n+1 from nearest prime.at n=9A051729
- a(n) is the smallest number for which the prime distance A051699 is equal to n.at n=19A077019
- Least positive k such that the distance from k to closest prime = n.at n=19A079582
- Triangle of coefficients of polynomials P(n; x) = Permanent(M), where M=[m(i,j)] is n X n matrix defined by m(i,j)=x if -1<=i-j<=1 else m(i,j)=1.at n=45A080018
- Expansion of f(q)*f(q^7)/(f(-q)*f(-q^7)) in powers of q where f() is a Ramanujan theta function.at n=36A123862
- Triangle T, read by rows, where column n of T = column 0 of T^(2^n) for n>0, such that column 0 (A129092) equals the row sums of the prior row, starting with T(0,0)=1.at n=29A129100
- Column 1 of triangle A129100; also equals column 0 of the matrix square of A129100.at n=6A129101
- Triangle T, read by rows, where row n (shifted left) of T equals row 0 of matrix power T^n for n>=0.at n=37A129104
- First string of 43 consecutive composite numbers.at n=18A177949
- Triangle read by rows: T(n,k) is the number of 2-compositions of n having k odd entries (0<=k<=n) A 2-composition of n is a nonnegative matrix with two rows, such that each column has at least one nonzero entry and whose entries sum up to n.at n=50A181295
- T(n,k) = Number of permutations of 1..n+2*k-1 with each element displaced by at least k.at n=26A183244
- Sum of binomial numbers A000332(k+3), with k in the reduced residue system modulo n.at n=19A192000
- Number of length-2n central circular binary strings without zigzags (see reference for precise definition).at n=12A263656
- Erroneous version of A263656.at n=12A283021
- Number T(n,k) of permutations p of [n] such that |p(j)-j| >= k (for all j in [n]); triangle T(n,k), n >= 0, 0 <= k <= floor(n/2), read by rows.at n=27A306543
- Number of compositions (ordered partitions) of n into heptagonal numbers (A000566).at n=45A322799
- Number T(n,k) of permutations p of [n] with no fixed points such that |{ j : |p(j)-j| = 1 }| = k; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows.at n=45A323671
- Number of multiples of n which have only distinct and nonzero digits in base 10.at n=35A328287