15963
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 22608
- Proper Divisor Sum (Aliquot Sum)
- 6645
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9984
- Möbius Function
- -1
- Radical
- 15963
- 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
- 97
- 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
- Numbers k such that k^2 contains exactly 9 different digits.at n=24A054037
- Numbers whose square is a zeroless pandigital number (i.e., use the digits 1 through 9 once).at n=5A071519
- Numbers k such that 7*11^k + 2 is prime.at n=19A083366
- Convolution of triangular numbers with partition numbers.at n=16A086716
- Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 6 and (n+7) mod 9 <> 1.at n=12A096025
- Numbers whose square is a permutational number A134640.at n=48A134742
- Numbers n such that n contains exactly 5 digits, all distinct, and n^2 contains exactly 9 distinct digits.at n=7A204691
- Number of (n+1)X(2+1) 0..1 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.at n=3A235730
- Number of (n+1)X(4+1) 0..1 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.at n=1A235732
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.at n=11A235736
- T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with the sum of each 2X2 subblock maximum and minimum lexicographically nondecreasing columnwise and nonincreasing rowwise.at n=13A235736
- Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 10.at n=46A240019
- Triangle read by rows, T(n, k) = S(k, n) with S(n, n) = 1, S(0, n) = 0 and otherwise S(k,n) = Sum_{i=1..n-k+1} k^i*S(k-1, n-i), for n>=0 and 0<=k<=n.at n=48A269955
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 630", based on the 5-celled von Neumann neighborhood.at n=13A283398
- Numbers whose square contains all of the digits 1 through 9.at n=5A294661
- Number of unlabeled antichains of finite sets spanning n vertices without singletons.at n=6A304998
- Number of partitions of n with up to three distinct kinds of 1.at n=35A320690
- Numbers k such that the two perfect powers immediately adjacent to k^2 both have exponents greater than 2.at n=22A340643
- Inverse Mobius transformation of A034714.at n=39A360429
- Numbers k such that any two consecutive decimal digits of k^2 differ by 1 after arranging the digits in decreasing order.at n=35A370362