15962
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 25056
- Proper Divisor Sum (Aliquot Sum)
- 9094
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7612
- Möbius Function
- -1
- Radical
- 15962
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 53
- 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 partitions of n into parts not of the form 17k, 17k+2 or 17k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 7 are greater than 1.at n=42A035963
- House numbers: a(n) = (n+1)^3 + Sum_{i=1..n} i^2.at n=22A051662
- Expansion of e.g.f.: (exp(x/(1-x)) - 1)^2.at n=6A052838
- Numbers k such that 279*2^k + 1 is prime.at n=22A053356
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 64.at n=20A068045
- Numbers k such that k^4 + 1, (k+2)^4 + 1 and (k+4)^4 + 1 are all primes.at n=18A073476
- Greater of a,b where n^2 = a^3 + b^3; a,b>0 and gcd(a,b)=1. The lesser of a,b is the corresponding term in A099532 and n, which is used to order this sequence, is the corresponding term in A099426.at n=38A099533
- a(n) = 8^n - 7^n + 1.at n=5A155659
- Expansion of g.f.: 2^(floor((n+1)/2))*n!*(1-y)^(n+1)*f(x, y, m), where f(x, y, m) = 2^(m+1)*exp(2^m*t)/((1-y*exp(t))*(1 + (2^(m+1)-1)*exp(2^m*t))), and m = 1.at n=34A171695
- Number of -n..n arrays x(0..2) of 3 elements with zeroth through 2nd differences all nonzero.at n=12A199944
- Number of (n+1)X(3+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or antidiagonally, with no adjacent elements equal.at n=8A232584
- a(n) = number of steps required to reach F(n+1)-1 from F(n+2)-1 by repeatedly subtracting from a natural number the number of ones in its Zeckendorf representation. Here F(n) = the n-th Fibonacci number, F(0) = 0, F(1) = 1, F(2) = 1, F(3) = 2, ...at n=26A261091
- Greater value of a coprime pair (x,y) satisfying x^3+y^3=z^2.at n=35A282639
- Smallest k such that both of the consecutive Woodall numbers A003261(k) and A003261(k+1) are divisible by A014662(n), the n-th prime p with even order of 2 mod p.at n=42A287145
- Number of irredundant sets in the n-antiprism graph.at n=10A290510
- Number of separable partitions of n in which the number of distinct (repeatable) parts is > 5.at n=42A325720
- Numbers k at which point A336459(k) appears multiplicative, but A051027(k) does not.at n=26A336561
- Triangle read by rows. T(n, k) = k! * Sum_{j=k..n} Lah(n, j) * Stirling2(j, k), where Lah(n, k) = A271703(n, k).at n=23A356654