15699
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 20936
- Proper Divisor Sum (Aliquot Sum)
- 5237
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10464
- Möbius Function
- 1
- Radical
- 15699
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 128
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=35A025104
- Numbers k such that (4*10^(k-1) - 7)/3 is a plateau prime.at n=10A082697
- Number of ways to place zero or more nonadjacent 0,0 1,0 2,0 3,1 4,2 4,3 4,4 polyhexes in any orientation on a planar nXnXn triangular grid.at n=8A155337
- First string of 43 consecutive composite numbers.at n=15A177949
- RATS: Reverse Add Then Sort the digits applied to previous term, starting with 6999.at n=1A209879
- Array of coefficients of polynomials providing the third term of the numerator of the generating function for odd powers (2*m+1) of Chebyshev S-polynomials. The present polynomials are called P(m;2,x^2), m >= 2.at n=23A217479
- a(n) is the minimal k such that nextprime(2k+1) - 2k = prime(n) where nextprime(n) is least prime > n.at n=19A229512
- Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and exactly two more elements moved upwards than downwards.at n=8A263785
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 865", based on the 5-celled von Neumann neighborhood.at n=23A273701
- Numbers k such that k![14]-2 is prime, where k![14] is the fourteen-fold multifactorial.at n=56A284190
- Numbers n such that prime(n) contains a substring of all the prime digits in order, i.e., "2357".at n=3A295708
- Greedy Cantor's Dust Partition.at n=46A348636
- Numbers k such that k and k+2 are both A000120-perfect numbers (A175522).at n=19A360639