9096
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 22800
- Proper Divisor Sum (Aliquot Sum)
- 13704
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3024
- Möbius Function
- 0
- Radical
- 2274
- Omega Function (Ω)
- 5
- 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
- 21
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 n-node trees with a forbidden limb of length 3.at n=16A002989
- Related to self-avoiding walks on square lattice.at n=7A006815
- Number of Young tableaux of height <= 6.at n=10A007579
- Aliquot sequence starting at 552.at n=6A014360
- Numbers k such that 31*2^k+1 is prime.at n=8A032365
- OR-convolution of squares A000290 with themselves.at n=23A033459
- Number of partitions of n with equal nonzero number of parts congruent to each of 0 and 1 (mod 3).at n=47A035537
- Partial sums of primes congruent to 1 mod 6.at n=41A038349
- Partial sums of rows of A047884. Young Tableaux by height.at n=50A049400
- Numbers k such that phi(k) + 1 = x^2 and sigma(k) + 1 = y^2 for some x and y.at n=40A063532
- Multiples of 24 whose digits also sum to 24.at n=39A066270
- Arithmetic derivative of n*prime(n).at n=35A068981
- Triangle, read by rows, where the n-th row lists the coefficients of the polynomial of degree n that generates the n-th diagonal of this sequence.at n=60A091150
- Indices of primes in sequence defined by A(0) = 43, A(n) = 10*A(n-1) - 27 for n > 0.at n=15A101713
- Triangle of numbers obtained from the partition array A134133.at n=48A134134
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (0, 0, 1), (0, 1, 0), (1, 0, -1)}.at n=8A149898
- Number of n X 5 1..3 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in increasing order.at n=4A166825
- Number of lower triangles of a 4 X 4 0..n array with each element differing from all of its horizontal and vertical neighbors by one.at n=43A195000
- O.g.f. satisfies: A(x) = Sum_{n>=0} n^n*(n+1)^(n-1) * exp(-n*(n+1)*x/A(x)) * (x/A(x))^n / n!.at n=5A219532
- a(n) = Sum_{i=0..n} Sum_{j=0..n} (i XOR j), where XOR is the binary logical exclusive-or operator.at n=24A224923